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.HashSet;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class TaskB {
        public void solve(int testNumber, Reader in, PrintWriter out) {
            int n, m;
            n = in.ni();
            m = in.ni();
            int[] a = new int[n];
            Helper.fillIntArray(in, a);
            for (int i = 0; i < n; i++) {
                a[i] %= m;
            }
            for (int i = 0; i < n; i++) {
                if (a[i] == 0) {
                    out.println("YES");
                    return;
                }
            }
            int[] cnt = new int[m];
            for (int i = 0; i < n; i++) {
                cnt[a[i]]++;
            }
            boolean[] dp = new boolean[m];
            boolean[] prev = new boolean[m];
            for (int i = 0; i < m; i++) {
                if (cnt[i] == 0) {
                    continue;
                }
                boolean[] wereAdded = new boolean[m];
                HashSet<Integer> opened = new HashSet<>();
                for (int j = 0; j < m; j++) {
                    int r = (j + i) % m;
                    if (prev[j] && !prev[r]) {
                        wereAdded[j] = true;
                        dp[r] = true;
                        opened.add(r);
                    }
                }
                for (int j = 1; j < cnt[i]; j++) {
                    HashSet<Integer> set = new HashSet<>();
                    for (Integer v : opened) {
                        int r = (v + i) % m;
                        if (!prev[r] && !wereAdded[r]) {
                            wereAdded[v] = true;
                            dp[r] = true;
                            set.add(r);
                        }
                    }
                    opened = set;
                }
                for (int j = 1; j <= cnt[i]; j++) {
                    dp[(j * i) % m] = true;
                }
                for (int j = 0; j < m; j++) {
                    prev[j] |= dp[j];
                }

            }
            if (prev[0]) {
                out.println("YES");
            } else {
                out.println("NO");
            }

        }

    }

    static class Reader {
        private BufferedReader in;
        private StringTokenizer st = new StringTokenizer("");
        private String delim = " ";

        public Reader(InputStream in) {
            this.in = new BufferedReader(new InputStreamReader(in));
        }

        public String next() {
            if (!st.hasMoreTokens()) {
                st = new StringTokenizer(rl());
            }
            return st.nextToken(delim);
        }

        public String rl() {
            try {
                return in.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }

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

    }

    static class Helper {
        public static void fillIntArray(Reader in, int[] a) {
            for (int i = 0; i < a.length; i++) {
                a[i] = in.ni();
            }
        }

    }
}

