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.*;
import java.util.*;

public class B {

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

    }

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        final int m = in.nextInt();
        class State{
            public int [] c = new int [m];
            State (){

            }
            State(State s) {
                System.arraycopy( s.c, 0, c, 0, s.c.length );
            }
        }

        State cur = new State();
        int[] a = new int[n];
        int[] c = new int[m];
        int[][] dp = new int[m][m];
        long res = 0;
        Queue<State> q = new LinkedList<State>();

        long sumMod = 0;
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt() % m;
            c[a[i]]++;
            cur.c[a[i]]++;
            //dp[0][a[i]] = 1;
            sumMod += a[i];
            if (sumMod % m == 0) {
                System.out.println("YES");
                return;
            }
        }
        if (c[0] == 0 && sumMod < m) {
            System.out.println("NO");
            return;
        }
        if (c[0] > 0) {
            System.out.println("YES");
            return;
        }


        for(int i = 1; i < m; i++) {
            for(int j = 0; j < m; j++)
                if (dp[i - 1][j] == 1){
                    dp[i][j] = 1;
                    int s = j;
                    for (int k = 0; k < c[i]; k++) {
                        s += i;
                        dp[i][s % m] = 1;
                    }
                }

            int s = 0;
            for (int k = 0; k < c[i]; k++) {
                s += i;
                dp[i][s % m] = 1;
            }
        }

        if (dp[m - 1][0] > 0) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }
//        q.add(cur);
//        while (!q.isEmpty()) {
//            cur = q.poll();
//            if (cur.c[0] > 0) {
//                System.out.println("YES");
//                return;
//            }
//            for(int i = 0; i < m; i++)
//                if (cur.c[i] > 0)
//            {
//                if (cur.c[i] > 1) {
//                    State ns = new State(cur);
//                    ns.c[i]--;
//                    ns.c[i]--;
//                    ns.c[(2 * i) % m]++;
//                    if (q.size() < 20000)
//                        q.add(ns);
//                }
//                for(int j = i + 1; j < m; j++)
//                if (cur.c[j] > 0)
//                {
//                    State ns = new State(cur);
//                    ns.c[i]--;
//                    ns.c[j]--;
//                    ns.c[(j + i) % m]++;
//                    if (q.size() < 20000)
//                        q.add(ns);
//                }
//            }
//        }

    }

}


