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.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Scanner;

public class Main {
    public static void main(String[] arg) {

        InputStream inputStream = System.in;
        InputReader inr = new InputReader(inputStream);
        Task solver = new Task();
        solver.solve();
    }

    static class Task {
        void solve() {
            Scanner sc = new Scanner(System.in);
            int n = sc.nextInt(), m = sc.nextInt();
            boolean[][] d = new boolean[2][m];
            int[] cnt = new int[m];
            ArrayList<Integer> a = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                ++cnt[x % m];
            }

            for (int i = 0; i < m; i++) {
                if (cnt[i] > 0) {
                    for (int j = 1, w = i; j <= cnt[i]; cnt[i] -= j, j <<= 1, w = w
                            * 2 % m) {
                        a.add(w);
                    }
                    if (cnt[i] > 0)
                        a.add(cnt[i] % m * i % m);
                }
            }
            int pre = 1, cur = 0;
            d[cur][a.get(0)] = true;
            for (int i = 1; i < a.size(); i++) {
                for (int j = m - 1; j >= 0; j--) {
                    if (d[cur][j])
                        d[pre][j] = d[pre][(j + a.get(i)) % m] = true;
                }
                d[pre][a.get(i)] = true;
                int t = pre;
                pre = cur;
                cur = t;
            }

//          for (int i = 0; i < a.size(); i++) {
//              System.out.println(a.get(i));
//          }

            if (d[cur][0])
                System.out.println("YES");
            else
                System.out.println("NO");
        }
    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                if (Character.isValidCodePoint(c))
                    res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

}
