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.util.LinkedList;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class tmp {
    public static void main(String [] args) throws Exception{
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());
        StringBuilder sb = new StringBuilder();
        
        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken()),a;
        
        
        int [] arr = new int[m+2];
        st = new StringTokenizer(in.readLine());
        for(int i=1; i<=n; i++){
            a = Integer.parseInt(st.nextToken())%m;
            for(int j=0; j<m; j++)
                if((arr[j]!=0) && arr[j]!=i && arr[(j+a)%m]==0)
                    arr[(j+a)%m] = i;
            arr[a] = i;
            if(arr[0]>0){
                System.out.println("YES");
                return;
            }
        }
        System.out.println("NO");
        
        
        
        
        
     
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
    }

    
    public static boolean allzero(ArrayList<Integer> h){
        for(int i=0; i<h.size(); i++)
            if(h.get(i) != 0)
                return false;
        return true;
    }
    
    
    
    

    
    
    
    
    


    
    
    
    
}

class Pair implements Comparable<Pair>{
    int x,y;
    
    public Pair(int fi, int ti){
        x = fi;
        y = ti;
    }
    
    public int compareTo(Pair p){
        return x < p.x ? -1 : (x == p.x ? (y < p.y ? -1 : 1) : 1);
    }
}