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.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.Vector;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author AL_DEEB
 */
public class Palindrome2000 {
   
   //static int[] a;
   
   static int m;
   static boolean f=false;
    public static void main(String[]args)
    {
        
        Scanner sc=new Scanner(System.in);
        
      int n=sc.nextInt();
       m=sc.nextInt();
    // a=new int[n];
   Set<Long>s=new HashSet<Long>();
   s.add(0L);
   if(n<m)
        for (int i = 0; i < n; i++) {
           
            Set<Long>next=new HashSet<Long>();
            if(f)break;
            int a=sc.nextInt();
            for (Long l : s) {
                next.add(l);
                long sum=(l+a)%m;
                if(sum==0)
                {
                    f=true;
                    break;
                }
                else
                    next.add(sum);
                
               s=next;
            }
      
        }
    else
        f=true;
   
        
        if(f)
      System.out.println("YES");
        else
            System.out.println("NO");
   
       // System.out.println(v);
    }
   // static Vector<String> v=new Vector<String>();
  // static Set<String> v=new HashSet<String>();
  public static void db()
  {
 
     
      
  }
  
        
     
    
}
