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 B
{
   public static void main(String[] args)
   {
      MyScanner scan = new MyScanner();
      int N = scan.nextInt();
      int M = scan.nextInt();
     
      int[] arr = new int[N];
      int[] cops = new int[M];
      boolean sums[] = new boolean[M];
      for(int i = 0; i<N; i++)
      {
         arr[i] = scan.nextInt();
      }
      
      for(int i = 0; i<N; i++)
      {
         boolean[] copyArr = Arrays.copyOf(sums, M);
         for(int j = 0; j<M; j++)
         {
            if(sums[j])
            {
               copyArr[(arr[i]+j)%M] = true;
            }
         }
         copyArr[arr[i]%M] = true;
         sums = copyArr;
         if(sums[0] == true)
         {
            break;
         }
      }
      
      if(sums[0])
      {
         System.out.println("YES");
      }
      else
      {
         System.out.println("NO");
      }
      
   }
   
   public static boolean isSubsetSum(int set[], int n, int sum)
   {
      boolean subset[][] = new boolean[sum+1][n+1];
      for (int i = 0; i <= n; i++)
         subset[0][i] = true;
         
      for (int i = 1; i <= sum; i++)
         subset[i][0] = false;
   
      for (int i = 1; i <= sum; i++)
      {
         for (int j = 1; j <= n; j++)
         {
            subset[i][j] = subset[i][j-1];
            if (i >= set[j-1])
               subset[i][j] = subset[i][j] || subset[i - set[j-1]][j-1];
         }
      }
      
      return subset[sum][n];
   }
   
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
   
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
   
      String next() {
         while (st == null || !st.hasMoreElements()) {
            try {
               st = new StringTokenizer(br.readLine());
            } 
            catch (IOException e) {
               e.printStackTrace();
            }
         }
         return st.nextToken();
      }
   
      int nextInt() {
         return Integer.parseInt(next());
      }
   
      long nextLong() {
         return Long.parseLong(next());
      }
   
      double nextDouble() {
         return Double.parseDouble(next());
      }
   
      String nextLine() {
         String str = "";
         try {
            str = br.readLine();
         } 
         catch (IOException e) {
            e.printStackTrace();
         }
         return str;
      }
   }
}