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.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Abood2B {






	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int n = sc.nextInt();
		int m = sc.nextInt();

		int[] f = new int[m];

		for (int i = 0; i < n; i++) {
			f[sc.nextInt() % m] ++;
		}

		int[] can = new int[m];
		Arrays.fill(can, -2);

		for (int i = 0; i < m; i++) 
			for (int j = 1; j <= f[i]; j++) {
				if(can[(j * i) % m] == -2)
					can[(j * i) % m] =  i;
				else
					can[(j * i) % m] =  -1;
			}

		if(can[0] != -2) {
			System.out.println("YES");
			return;
		}

//		System.out.println(Arrays.toString(can));

		boolean[] v = new boolean[m];
		
		
		for (int i = 0; i < m; i++) {
			
			
			boolean[] tmp = new boolean[m];
			
			for (int j = 0; j < m; j++) {
				if(can[j] != i)
					continue;
				
				for (int k = 0; k < m; k++) {
					if(v[k]) {
						tmp[(j + k) % m] = true;
					}
				}
				
				tmp[j] = true;
			}
			
			for (int j = 0; j < m; j++) {
				v[j] |= tmp[j];
			}
//			System.out.println(Arrays.toString(v));
			
			if(v[0]) {
				System.out.println("YES");
				return;
			}
			
		}
		
		for (int j = 0; j < m; j++) {
			if(can[j] != -1)
				continue;
			boolean[] tmp = new boolean[m];

			for (int k = 0; k < m; k++) {
				if(v[k]) {
					tmp[(j + k) % m] = true;
				}
			}
			
			tmp[j] = true;
			for (int i = 0; i < m; i++) {
				v[i] |= tmp[i];
			}
			if(v[0]) {
				System.out.println("YES");
				return;
			}
		}
		

		

		System.out.println("NO");
		out.flush();

	}


	static class Scanner 



	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

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

		public int nextInt() throws IOException {return Integer.parseInt(next());}

		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}


		public double nextDouble() throws IOException
		{
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if(x.charAt(0) == '-')
			{
				neg = true;
				start++;
			}
			for(int i = start; i < x.length(); i++)
				if(x.charAt(i) == '.')
				{
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				}
				else
				{
					sb.append(x.charAt(i));
					if(dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg?-1:1);
		}

		public boolean ready() throws IOException {return br.ready();}



	}

}