You are given a sequence of numbers a1, a2, ..., an, and a number m.

Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.

Input

The first line contains two numbers, n and m (1 ≤ n ≤ 106, 2 ≤ m ≤ 103) — the size of the original sequence and the number such that sum should be divisible by it.

The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).

Output

In the single line print either "YES" (without the quotes) if there exists the sought subsequence, or "NO" (without the quotes), if such subsequence doesn't exist.

Examples

Input

3 5
1 2 3


Output

YES


Input

1 6
5


Output

NO


Input

4 6
3 1 1 3


Output

YES


Input

6 6
5 5 5 5 5 5


Output

YES

Note

In the first sample test you can choose numbers 2 and 3, the sum of which is divisible by 5.

In the second sample test the single non-empty subsequence of numbers is a single number 5. Number 5 is not divisible by 6, that is, the sought subsequence doesn't exist.

In the third sample test you need to choose two numbers 3 on the ends.

In the fourth sample test you can take the whole subsequence.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author robert nabil
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        boolean[][][] dp;
        boolean[][][] calc;

        public void solve(int testNumber, FastScanner sc, PrintWriter writer) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int[] c = new int[m];
            for (int i = 0; i < n; i++) {
                c[sc.nextInt() % m]++;
            }

            dp = new boolean[m][m][2];
            calc = new boolean[m][m][2];


            writer.println(can(c, 0, 0, false) ? "YES" : "NO");
        }

        boolean can(int[] c, int ind, int sum, boolean tookAtLeastOne) {
//        System.out.println("ind : " + ind + " sum : " + sum + " " + tookAtLeastOne);
            if (tookAtLeastOne && sum == 0)
                return true;

            if (ind == c.length)
                return sum == 0 && tookAtLeastOne;

            if (calc[ind][sum][tookAtLeastOne ? 1 : 0])
                return dp[ind][sum][tookAtLeastOne ? 1 : 0];

            for (int i = 0; i <= c[ind]; i++) {
                if (can(c, ind + 1, (sum + (i * ind) % c.length) % c.length, tookAtLeastOne || (i != 0))) {
                    calc[ind][sum][tookAtLeastOne ? 1 : 0] = true;
                    dp[ind][sum][tookAtLeastOne ? 1 : 0] = true;
                    return true;
                }
            }

            calc[ind][sum][tookAtLeastOne ? 1 : 0] = true;
            dp[ind][sum][tookAtLeastOne ? 1 : 0] = false;
            return false;
        }

    }

    static class FastScanner {
        BufferedReader r;
        StringTokenizer tokenizer;

        public FastScanner(InputStream in) {
            r = new BufferedReader(new InputStreamReader(in));
            tokenizer = new StringTokenizer("");
        }

        public String next() {
            while (!tokenizer.hasMoreTokens())
                try {
                    tokenizer = new StringTokenizer(r.readLine());
                } catch (Exception e) {
                    return null;
                }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}
