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

public class Main {

    static int arr[], n, x;
    static byte[][][] mem;

    public static void main(String[] args) throws IOException {
        FastPrinter out = new FastPrinter(System.out);
        InputReader in = new InputReader(System.in);
        int n = in.nextInt(), x = in.nextInt();
        short arr[] = new short[n];
        for (int i = 0; i < n; i++)
            arr[i] = (short) (in.nextInt() % x);
        byte[][][] mem = new byte[2][2][x];
        mem[1][1][0] = 1;
        for (int i = n - 1; i >= 0; i--) {
            for (int j = x - 1; j >= 0; j--) {
                mem[0][0][j] = (byte) (mem[1][0][j] | mem[1][1][(j + arr[i])
                        % x]);
                mem[0][1][j] = (byte) (mem[1][1][j] | mem[1][1][(j + arr[i])
                        % x]);
            }

            if (mem[0][0][0] == 1)
                break;
            mem[1][0] = mem[0][0].clone();
            mem[1][1] = mem[0][1].clone();
        }
        if (mem[0][0][0] == 0)
            out.println("NO");
        else
            out.println("YES");
        out.close();
    }
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        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 String nextLine() {
        try {
            return reader.readLine();
        } catch (IOException e) {
            e.printStackTrace();
            return null;
        }
    }

    public int[] readIntArray(int n) {
        int[] ret = new int[n];
        for (int i = 0; i < n; i++)
            ret[i] = nextInt();
        return ret;
    }

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

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

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

    public BigInteger nextBigInt() {
        return new BigInteger(next());
    }

}

class FastPrinter extends PrintWriter {

    public FastPrinter(OutputStream out) {
        super(out);
    }

    public FastPrinter(Writer out) {
        super(out);
    }

}