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 B2 {
	
	public static void main(String[] args) throws IOException {
		
		FastScanner qwe = new FastScanner();
		
		int n = qwe.nextInt();
		int m  =qwe.nextInt();
		
		int[] mods=  new int[m];
		for (int i = 0; i < n; i++) {
			mods[qwe.nextInt()%m]++;
		}
		
		boolean[] mseen = new boolean[m];
		
		ArrayDeque<Integer> seen = new ArrayDeque<Integer>();
		seen.add(0);
		
		outer:
		for (int i = 0; i < mods.length; i++) {
			int q = mods[i];
			
			while(q-->0){
				int size = seen.size();
				while(size-->0){
					int at = seen.poll();
					if(!mseen[(at+i)%m]){
						mseen[(at+i)%m] = true;
						seen.add((at+i)%m);
						if(mseen[0]) break outer;
					}
					seen.add(at);
				}
				
			}
			
			
		}
		
		if(mseen[0]) System.out.println("YES");
		else System.out.println("NO");
		
		
	}
	
	static class FastScanner{
		BufferedReader br;
		StringTokenizer st;
	 
		FastScanner() throws IOException{
			//br = new BufferedReader(new FileReader("file.in"));
			br = new BufferedReader(new InputStreamReader(System.in));
			st = new StringTokenizer(br.readLine().trim());
		}
	 
		public int numTokens() throws IOException{
			if(!st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine().trim());
				return numTokens();
			}
			return st.countTokens();
		}
	 
		public String next() throws IOException{
			if(!st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine().trim());
				return next();
			}
			return st.nextToken();
		}
		
		public boolean hasnext() throws IOException{
			if(st.hasMoreTokens()) return true;
			String line = br.readLine();
			if(line == null) return false;
			
			st = new StringTokenizer(line.trim());
			return true;
		}
	 
		public int nextInt() throws IOException{
			return Integer.parseInt(next());
		}
	 
	}


}
