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

public class MODULO_SUM {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		FastReader s = new FastReader();
		int N = s.nextInt();
		int K = s.nextInt();
		
		int[] count = new int[K];
		boolean[] arr = new boolean[K];
		for(int j=0;j<N;j++) {
			int x = s.nextInt();
			count[x%K]++;	
			
			//System.out.println("Got "+j);
		}
		
		
		for(int j=0;j<K;j++) 
		{
			if(count[j]>0) {
				//System.out.println("There at "+j);
				for(int i=1;i<=count[j];i++) {
					boolean[] isNew = new boolean[K];
				//	System.out.println("Hry at "+i);
					for(int k=0;k<K;k++) {
						
						//System.out.println("hello at "+k);
						if(arr[k]&&!isNew[k]) {
							//System.out.println((j+k)%K+" at "+i);
							if(!arr[(j+k)%K])
								isNew[(j+k)%K] = true;
							arr[(j+k)%K] = true;
							if(arr[0])
							    break;
						}
					}
					
					arr[j] = true;
					if(arr[0])
						break;
					//System.out.println();
				}
				
				if(arr[0])
					break;
				
				
			}
			
			
		}
		
		if(arr[0])
			System.out.println("YES");
		else
			System.out.println("NO");

	}
	
	static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
    
         

}
