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.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class Main {
	
	static int n,m;
	
	static ArrayList<Integer> a;
	static boolean[][] memo , vis;
	
	static boolean dp(int idx,int sum)
	{
		if(sum>0 && sum%m==0)return true;
		sum%=m;
		if(idx>=a.size())return false;
		if(vis[idx][sum])return memo[idx][sum];
		
		boolean ans = dp(idx+1,sum);
		if(!ans)ans = dp(idx+1,sum+a.get(idx));
		
		vis[idx][sum] = true;
		return memo[idx][sum] = ans;
	}
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt() ; m = sc.nextInt();
		int[] mod = new int[m+1];
		a = new ArrayList<>();
		for(int i = 0; i < n;i++)
		{
			int x = sc.nextInt();
			if(x!=0)
			{
				if(x%m==0)
					++mod[m];
				else
					++mod[x%m];
			}
			else
			{
				System.out.println("YES");
				return;
			}
		}
		
		for(int i = 0; i < mod.length;i++)
		{
			if(mod[i]==0)continue;
			int mask = 1;
			while(mask<=mod[i])
			{
				a.add(mask*i);
				mod[i]-=mask;
				mask<<=1;
			}
			if(mask>mod[i])
				a.add(i * mod[i]);
		}
		memo = new boolean[a.size()][m+1];
		vis = new boolean[a.size()][m+1];
		boolean ans = dp(0, 0);
		System.out.println(ans?"YES":"NO");
	}
	

	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
		public Scanner(String s) throws FileNotFoundException {br = new BufferedReader(new FileReader(s));}
		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		public String nextLine() throws IOException {return br.readLine();}		
		public long nextLong() throws IOException {return Long.parseLong(next());}		
		public double nextDouble() throws IOException {return Double.parseDouble(next());}	
		public char nextChar() throws IOException{return next().charAt(0);}
		public boolean ready() throws IOException {return br.ready();}
		public int[] nextIntArr() throws IOException{
			st = new StringTokenizer(br.readLine());
			int[] res = new int[st.countTokens()];
			for (int i = 0; i < res.length; i++)
				res[i] = nextInt();
			return res;
		}
		public char[] nextCharArr() throws IOException{
			st = new StringTokenizer(br.readLine());
			char[] res = new char[st.countTokens()];
			for (int i = 0; i < res.length; i++) 
				res[i] = nextChar();
			return res;
		}
	}

}