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.InputStreamReader;

public class ModuloSum {
    static int[] nums = new int[1000000];
    static int n, m;
    static int DP[][] = new int[1001][1001];

    static boolean go(int i, int mod) {
        if (mod == 0)
            return true;
        if (i >= m)
            return false;
        if (DP[i][mod] != 0)
            return DP[i][mod] == 1 ? true : false;
        boolean ans = go(i + 1, mod) | go(i + 1, (mod + nums[i]) % m);
        DP[i][mod] = ans ? 1 : 2;
        return ans;
    }

    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String l[] = bf.readLine().split(" ");
        n = Integer.parseInt(l[0]);
        m = Integer.parseInt(l[1]);
        l = bf.readLine().split(" ");

        for (int i = 0; i < l.length; i++) {
            nums[i] = Integer.parseInt(l[i]);
        }
        for (int i = 0; i < n; i++) {
            if (go(i + 1, nums[i] % m)) {
                System.out.println("YES");
                return;
            }
        }
        System.out.println("NO");
    }
}
