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.awt.*;
import java.io.*;
import java.util.*;

public class Abc {
    static int n,m;
    static int dp[][];
    static int arr[];
    public static void main(String[] args) throws Exception {
        FastReader sc = new FastReader();
        n=sc.nextInt();m=sc.nextInt();
        if (n>m){
            System.out.println("YES");
            return;
        }
        arr=new int[n];
        dp=new int[n][m+1];
        for (int i=0;i<n;i++)arr[i]=sc.nextInt()%m;
        for (int ar[]:dp)Arrays.fill(ar,-1);
        if (dp(0,m)==0) System.out.println("NO");
        else System.out.println("YES");

    }
    static int dp(int i,int rem){
        if (i==n){
            if (rem==0) {
                return 1;
            }
            return 0;
        }
        if (rem==0){
            return 1;
        }
//        System.out.println(i+" "+rem);
        if (dp[i][rem]!=-1)return dp[i][rem];
        return dp[i][rem]=dp(i+1,(arr[i]+rem)%m)|dp(i+1,rem);
    }
    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;
        }
    }
}