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 Solution{
	static PrintWriter out=new PrintWriter(System.out);
	public static void main (String[] args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String[] temp=br.readLine().trim().split(" ");
		
	    int n=Integer.parseInt(temp[0]);
	    int m=Integer.parseInt(temp[1]);
	    int[] arr=new int[n];
	    
	    temp=br.readLine().trim().split(" ");
	    for(int i=0;i<n;i++) {
	    	arr[i]=Integer.parseInt(temp[i]);
	    }
	    out.println(isPossible(arr,m));
	    
		out.flush();
		out.close();
	}
	public static String isPossible(int[] arr,int m)
	{
		int n=arr.length;
		if(n>m){
		    return "YES";
		}
		
		for(int i=0;i<n;i++){
		    arr[i]%=m;
		}
		int[][] dp=new int[n][m+1];
		for(int i=0;i<dp.length;i++){
		    for(int j=0;j<dp[0].length;j++){
		        dp[i][j]=-1;
		    }
		}
		int ans=subsetSum(arr,m,0,0,dp,0);
		if(ans==1){
		    return "YES";
		}
		else{
		    return "NO";
		}
	}
	public static int subsetSum(int[] arr,int m,int start,int sum,int[][] dp,int num)
	{
	    if(sum%m==0 && num>0){
	        return 1;
	    }
	    if(start==arr.length){
	        return 0;
	    }
	    if(dp[start][sum]>=0){
	        return dp[start][sum];
	    }
	    int option1=subsetSum(arr,m,start+1,sum%m,dp,num);
	    int option2=subsetSum(arr,m,start+1,(sum%m+arr[start])%m,dp,num+1);
	    int ans=option1|option2;
	    dp[start][sum]=ans;
	    return ans;
	}
}
