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



public class Main
{
	public static int cnt1,cnt2,x,y;
	static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	public static void main(String[] args)throws IOException
	{
	while (in.nextToken() != StreamTokenizer.TT_EOF) 
	{
		int a=(int)in.nval;
		int a1=nextInt();
		int k[]=new int[a1+1];
		int k2[]=new int[a1+1];
		int k3[]=new int[a1+1];
		int n=0,n1=0,n2=0;
		int k1[]=new int[100000];
		for(int i=0;i<=a1;i++)
		{
			k2[i]=0;
			k[i]=0;
		}
		for(int i=1;i<=a;i++)
		{
			int c=nextInt();
			c=c%a1;
			k[c]++;
		}
		for(int i=0;i<=a1;i++)
		{
			int t=1;
			while(k[i]-t>=0)
			{
				k[i]-=t;
				k1[n+1]=t*i;
				t*=2;
				n++;
			}
			if(k[i]==0)
			{
				continue;
			}

				k1[n+1]=k[i]*i;
				n++;
		}

		boolean a2[][]=new boolean[n+10][a1+1];
		a2[0][0]=true;
		for(int j=1;j<=a1;j++)
		{
			a2[0][j]=false;
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=0;j<=a1;j++)
			{
				a2[i][j]=a2[i-1][j]||a2[i-1][(j-k1[i]%a1+a1)%a1];
			}
		}
		if(a2[n][a1])
		{
			System.out.println("YES");
		}
		else
		{
			System.out.println("NO");
		}
	}
	}
	static int nextInt() throws IOException {
		in.nextToken();
		return (int) in.nval;
	}

	static String nextLine() throws IOException 
	{
		in.nextToken();
		return in.sval; 
	} 

}

 	 		  	 		 		   		 			 			 		