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 Codeforces {
         
        static int arr[], m;
        static int dp[][][] = new int[1001][2][1001];
        public static void main(String[] args) throws IOException {
            Reader.init(System.in);
            int n = Reader.nextInt();
            m = Reader.nextInt();
            
            arr = new int[m];
            for(int i = 0; i < n; i++)
                arr[Reader.nextInt() % m]++;
            
            for(int i = 0; i < 1001; i++){
                Arrays.fill(dp[i][0], -1);
                Arrays.fill(dp[i][1], -1);
            }
                
            
            if(calc(0, 0, false))
                System.out.println("YES");
            else
                System.out.println("NO");
        }
        
        static boolean calc(int i, int rem, boolean ok){
            if(rem == 0 && ok)
                return true;
            
            if(i == arr.length)
                return rem == 0 && ok;
            
            int x = ok ? 1 : 0;
            
            if(dp[i][x][rem] != -1)
                return dp[i][x][rem] == 1;
            
            boolean ret = false;
            for(int j = 0; j <= arr[i]; j++){
                ret |= calc(i+1, (rem + j * i) % m, ok || (j > 0));
                if(ret) return ret;
            }
            
            dp[i][x][rem] = ret ? 1 : 0;
            
            return ret;
        }
    }
        
    
    class  Edge implements Comparable<Edge>{

        int to;
        int cost;
        
        Edge(int a, int b){
            to = a;
            cost = b;
        }

        @Override
        public int compareTo(Edge t) {
            return cost - t.cost;
        }
    }




    class Reader {

        static BufferedReader reader;
        static StringTokenizer tokenizer;

        public static int pars(String x) {
            int num = 0;
            int i = 0;
            if (x.charAt(0) == '-') {
                i = 1;
            }
            for (; i < x.length(); i++) {
                num = num * 10 + (x.charAt(i) - '0');
            }

            if (x.charAt(0) == '-') {
                return -num;
            }

            return num;
        }

        static void init(InputStream input) {
            reader = new BufferedReader(
                    new InputStreamReader(input));
            tokenizer = new StringTokenizer("");
        }

        static void init(FileReader input) {
            reader = new BufferedReader(input);
            tokenizer = new StringTokenizer("");
        }

        static String next() throws IOException {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(
                        reader.readLine());
            }
            return tokenizer.nextToken();
        }

        static int nextInt() throws IOException {
            return pars(next());
        }

        static long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        static double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }