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

/**
 * Created by bsv on 20.09.2015.
 */
public class Solver557B {

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

    BufferedReader br;
    PrintWriter pw;
    StringTokenizer stock;

    public String nextToken() throws IOException {
        if (stock == null || !stock.hasMoreTokens()) {
            stock = new StringTokenizer(br.readLine());
        }
        return stock.nextToken();
    }

    public int nextInt() throws NumberFormatException, IOException {
        return Integer.parseInt(nextToken());
    }


    public void run() throws IOException {
//        br = new BufferedReader(new FileReader("input.txt"));
//        pw = new PrintWriter("output.txt");
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));

        int n = nextInt();
        int del = nextInt();
        boolean[] mas = new boolean[del];
        for (int i = 0; i < n; i++) {
            int num = nextInt();
            boolean[] next = new boolean[del];
            for (int j = 0; j < del; j++) {
                if (mas[j]) {
                    next[(j + num) % del] = true;
                    next[j]=true;
                }
            }
            next[num % del] = true;
            mas=next;
            if (mas[0]) {
                pw.println("YES");
                pw.flush();
                pw.close();
                return;
            }
        }
        pw.println("NO");
        pw.flush();
        pw.close();

    }
}
