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;

public class Main {

	private static long[] data;
	private static long[][][] memo;
	private static int n;
	private static int m;

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] tokens = br.readLine().split("\\s");
		n = Integer.parseInt(tokens[0]); m = Integer.parseInt(tokens[1]);

		if (n >= m) {
			System.out.println("YES");
			System.exit(0);
		}

		tokens = br.readLine().split("\\s");
		data = new long[n + 10];
		for (int i = 0; i < n; i++) data[i] = Integer.parseInt(tokens[i]);

		memo = new long[m + 10][m + 10][3];
		for (int i = 0; i < m + 10; i++)
			for (int j = 0; j < m + 10; j++)
				for (int k = 0; k < 3; k++) memo[i][j][k] = -1;
		
		if (solve(0,0,0) == 1) System.out.println("YES");
		else System.out.println("NO");
	}

	private static long solve(int i, int mod, int res){
		if (mod == 0 && res == 1) return 1;
		if (i == n) return 0;
		if (memo[i][mod][res] != -1) return memo[i][mod][res];

		if (solve(i + 1, (int)(mod + data[i]) % m, 1) == 1) return memo[i][mod][res] = 1;
		if (solve(i + 1, mod, 0) == 1) return memo[i][mod][res] = 1;

		return memo[i][mod][res] = 0;
	}
}
