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.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class ModuloSum {
	int[] visited;
	public String moduloSum(int[] array, int m) {
		//if(array.length > m) {
		//	return "YES";
		//}
		visited = new int[m];
		Arrays.fill(visited, -1);
		for(int i = 0; i < array.length; i++) {
			if(dfs(array, m, array[i] % m, i + 1, visited)) {
				return "YES";
			}
		}
		return "NO";
	}
	private boolean dfs(int[] array, int m, int cur, int index, int[] visited) {	
		if(index == array.length) {
			if(cur == 0) {
				return true;
			}
			return false;
		}
		if(visited[cur] != -1 && index >= visited[cur]) {
			return false;
		}
		if(dfs(array, m, cur, index + 1, visited)) return true;
		int tmp =  (cur + array[index] % m) % m;
		if(dfs(array, m, tmp, index + 1, visited)) return true;
		visited[cur] = index;
		return false;
	}
	public static void main(String[] args) throws FileNotFoundException  {
		ModuloSum solu = new ModuloSum();
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[] array = new int[n];
		for(int i = 0; i < n; i++) {
			array[i] = sc.nextInt();
		}
		System.out.println(solu.moduloSum(array, m));
	} 
}
