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

public class Sumseq {
    public static void main(String[] argv) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int m = input.nextInt();
        int[] seq = new int[m + 1];      //
        for (int i = 0; i < n; i++) {
            
            int elemseq = input.nextInt();
//          System.out.println("--------------  i: "+i);
            
//          System.out.println("elemseq: "+elemseq);
            int[] seqnew = Arrays.copyOf(seq, m + 1);
            
            
            
            seqnew[elemseq % m] = 1;
    //      System.out.println("seqnew["+ elemseq % m+"] "+" = "+" 1 ");

            for (int j = 1; j < m; j++) {
                if (seq[j] == 1) {
                    seqnew[(elemseq + j) % m] = 1;
//                  System.out.println("------ j: "+j);
    //              System.out.println("seqnew["+ (elemseq + j) % m +"] "+" = "+" 1 ");
                }
            }

            seq = Arrays.copyOf(seqnew, m + 1);
            if (seq[0] == 1) {
                System.out.println("YES");
//              System.out.println("seq[0]="+ seq[0]);
//              System.out.println("seq[1]="+ seq[1]);
//              System.out.println("seq[2]="+ seq[2]);
//              System.out.println("seq[3]="+ seq[3]);
//              System.out.println("seq[4]="+ seq[4]);
//              System.out.println("seq[5]="+ seq[0]);
                System.exit(0);
            }
        }
        System.out.println("NO");

    }
}

