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

public class Solution{
    
    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;
        }
    }
    
	public static void main (String[] args) {
	    FastReader sc = new FastReader();
	    PrintWriter out = new PrintWriter(System.out);
	    
	    long n = sc.nextLong();
	    int m = sc.nextInt();
	    long[] arr = new long[(int)n+1];
	    boolean fg=false;
	    for(int i=1;i<=n;i++){
	        arr[i] = sc.nextLong();
	        if(arr[i]==0) fg = true;
	    }
	    
	    if( n>m || fg){
	        out.println("YES");
	        out.close();
	        return;
	    }
	    
	    boolean[][] dp = new boolean[(int)n+1][m+1];
	    dp[0][0] = true;
	    for(int i=1;i<=n;i++){
	        
	        int val=0;
	        if(arr[i]%m==0 && arr[i]!=0)
	            val = m;
	        else
	            val = (int)arr[i]%m;
	            
	        for(int j=0;j<=m;j++){
	            dp[i][j] |= dp[i-1][j];
	            
	            int cur=val+j;
	            if(cur>m) cur = cur%m;
	            dp[i][cur] |= dp[i-1][j];
	        }
	    }
	    
	    /*for(int i=0;i<=m;i++){
	        for(int j=0;j<=n;j++){
	            out.print(dp[j][i]+" ");
	        }
	        out.println("");
	    }*/
	    
	    out.println(dp[(int)n][m]?"YES":"NO");
	    out.close();
	}
}