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.Point;
import java.io.*;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.security.KeyStore.Entry;
import java.util.*;
import java.io.*;
public class Tests {
	static Scanner in = new Scanner(); 
	static PrintWriter out = new PrintWriter (System.out);
	static int n , m;
	static int a [];
	static Boolean memo [][];
    public static void main (String[] test) throws NumberFormatException, IOException{
    	n = in.nextInt(); m = in.nextInt();
    		if(n >= m){
    		out.append("YES\n");
    		out.close();
    		System.exit(0);
    	}
    	a = new int [n];
    	memo = new Boolean [n+1][m+1];
    	for(int i = 0 ; i<n; a[i++] = in.nextInt() % m);
    
    	out.append(dp(0,0) ? "YES\n" : "NO\n");
        out.flush();
    	out.close();
    }
    static Boolean dp (int index , int rem){
    	if(rem == m){
    		return true;
    	}
    	if(index == n){
    		return false;
    	}
    	if(memo[index][rem] != null){
    		return memo[index][rem];
    	}
    	Boolean ret = dp(index+1 , ((a[index]+rem)%m) == 0 ? m : ((a[index]+rem)%m) ) | dp(index+1 , rem);
    	return memo[index][rem] = ret;
    }
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		Scanner(String file) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(file));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

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

	}

}