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


public class ModuloSum {

	static int[] arr;
	static int m;
	static int n;
	static int[][] db;
	
	public static int find(int i, int sum) {
		if(i >= n) {
			if(sum == 0)
				return 1;
			return -999999999;
		}
		if(db[i][sum%m] != 0)
			return db[i][sum%m];
		int a = find(i+1, sum%m);
		int b = find(i+1, (sum+arr[i])%m) +1;
		
		db[i][sum%m] = Math.max(a, b);
		return db[i][sum%m];
	}
	
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		n = s.nextInt();
		arr = new int[n];
		m = s.nextInt();
		for(int i = 0; i < n; i++) {
			arr[i] = (int) (s.nextLong()%m);
		}
//		System.out.println(Arrays.toString(arr));
		s.close();
		if(n > m ) {
			System.out.print("YES");
			return;
		} else {
			db = new int[n][m];
			for(int i = 0; i < n; i++)
				Arrays.fill(db[i], 0);
			if(find(0,0) > 1)
				System.out.print("YES");
			else
				System.out.print("NO");
		}
	}

}
