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.*;
import java.lang.*;

public class X
{
	public static void main(String[] args)
	{
		X ob=new X();
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int M=sc.nextInt();
		int[] A=new int[N];;
		for(int i=0;i<N;i++)
			A[i]=sc.nextInt()%M;
		boolean b=ob.solve(A,M);
		if(b)
			System.out.println("YES");
		else
			System.out.println("NO");
	}
	boolean solve(int[] A, int M)
	{
		ArrayList<Integer> AL =new ArrayList<Integer>();
		HashSet<Integer> hs=new HashSet<Integer>();
		for(int i=0;i<M;i++)
			AL.add(i);
		//for(int i=0;i<M;i++)
			//System.out.print(AL.get(i));
		int x=0;
		for(int i=0;i<A.length;i++)
		{
			//System.out.println();
			for(int j=AL.size()-1;0<=j;j--)
			{
				if(A[i]<AL.get(j))
					x=AL.get(j)-A[i];
				else if(AL.get(j)<A[i])
					x=M-A[i]+AL.get(j);
				if(!AL.contains(x) && !hs.contains(x))
				{
					hs.add(AL.get(j));
					//System.out.println("ELEMENT REMOVED="+AL.get(j));
					AL.remove(new Integer(AL.get(j)));
				}
			}
			if(AL.contains(A[i]))
			{
				//System.out.println("ELEMENT REMOVED here="+A[i]);
				AL.remove(new Integer(A[i]));
			}
			hs.clear();
		}
		return !AL.contains(new Integer(0));
	}
}
	
