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.*;
import java.util.*;
public final class modulo_sum
{
    static FastScanner sc=new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter out=new PrintWriter(System.out);
	
	public static void main(String args[]) throws Exception
	{
		int n=sc.nextInt(),m=sc.nextInt();
		int[] a=new int[n];
		boolean ans=false;
		for(int i=0;i<n;i++)
		{
			a[i]=sc.nextInt()%m;
			if(a[i]==0)
			{
				ans=true;
			}
		}
		List<Integer> list=new ArrayList<Integer>();
		boolean[] v=new boolean[m];
		list.add(a[0]);
		v[a[0]]=true;
		outer:
		for(int i=1;i<n;i++)
		{
			int curr=list.size();
			for(int j=0;j<curr;j++)
			{
				if((list.get(j)+a[i])%m==0)
				{
					ans=true;
					break outer;
				}
				else if(!v[(list.get(j)+a[i])%m])
				{
					v[(list.get(j)+a[i])%m]=true;
					list.add((list.get(j)+a[i])%m);
				}
			}
			if(!v[a[i]])
			{
				list.add(a[i]);
			}
		}
		out.println((ans)?"YES":"NO");
		out.close();
	}
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}