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

@SuppressWarnings("unchecked")
public class Solution {
    public static final int INF = (int) 1e8;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer stringTokenizer;

    public static void main(String[] args) throws Exception {
        new Solution().run();
    }

    int[] a;
    int n;
    int mod;
    int[] f;


    public void run() throws Exception {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        n = nextInt();
        mod = nextInt();
        boolean find = false;


        a = new int[n];
        f = new int[mod];

        for (int i = 0; i < n; i++) {
            a[i] = nextInt();
        }

        for (int i = 0; i < mod; i++) {
            f[i] = INF;
            //  f[i] = -1;
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < mod; j++) {
                if (f[j] < i) {
                    f[(j + a[i]) % mod] = Math.min(i, f[(j + a[i]) % mod]);
              //      f[(j + a[i]) % mod] = i;
                }
            }

            f[(a[i]) % mod] = i;

            if (f[0] < INF / 2) {
                find = true;
                break;
            }
        }

        if (find) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }
    }

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            String line = in.readLine();
            if (line == null) {
                throw new IOException();
            }

            stringTokenizer = new StringTokenizer(line);
        }
        return stringTokenizer.nextToken();
    }

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

    double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

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