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.
/*
 *created by Kraken on 10-05-2020 at 10:32
 */
//package com.kraken.cf.practice;

import java.util.*;
import java.io.*;

public class B577 {

  public static void main(String[] args) {
    FastReader sc = new FastReader();
    int n = sc.nextInt(), m = sc.nextInt();
    if (n > m) {
      System.out.println("YES");
      return;
    }
    long[] x = new long[n + 1];
    boolean[][] dp = new boolean[n + 1][m + 1];
    for (int i = 0; i < n; i++) {
      x[i] = sc.nextLong();
    }
    for (int i = 0; i < n; i++) {
      dp[i + 1][(int) (x[i] % m)] = true;
      for (int j = 0; j < m; j++) {
        if (dp[i][j]) {
          dp[i + 1][j] = dp[i + 1][(int) ((j + x[i]) % m)] = true;
        }
      }
    }
    System.out.println(dp[n][0] ? "YES" : "NO");
  }

  static class FastReader {

    BufferedReader br;

    StringTokenizer st;

    public FastReader() {
      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;
    }
  }
}
