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.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class ModuloSum implements Closeable {

  private InputReader in = new InputReader(System.in);
  private PrintWriter out = new PrintWriter(System.out);

  public void solve() {
    int n = in.ni();
    m = in.ni();
    rem = new int[m];
    for (int i = 0; i < n; i++) {
      rem[in.ni() % m]++;
    }
    if (n > m) {
      out.println("YES"); 
    } else {
      dp = new Boolean[m][m][2];
      boolean ans = rem[0] >= 1 || recurse(1, 0, 0);
      out.println(ans ? "YES" : "NO");
    }
  }
  
  private int m;
  private int[] rem;
  private Boolean[][][] dp;
  
  private boolean recurse(int idx, int sum, int empty) {
    if (idx == rem.length) return sum == 0 && empty == 1;
    
    if (dp[idx][sum][empty] != null) return dp[idx][sum][empty];
    boolean ans = false;
    for (int count = 0; count <= rem[idx]; count++) {
      if (count == 0) {
        ans |= recurse(idx + 1, (sum + count * idx) % m, empty);
      } else {
        ans |= recurse(idx + 1, (sum + count * idx) % m, 1);
      }
    }
    return dp[idx][sum][empty] = ans;
  }

  @Override
  public void close() throws IOException {
    in.close();
    out.close();
  }

  static class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream), 32768);
      tokenizer = null;
    }

    public String next() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          tokenizer = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
          throw new RuntimeException(e);
        }
      }
      return tokenizer.nextToken();
    }

    public int ni() {
      return Integer.parseInt(next());
    }

    public long nl() {
      return Long.parseLong(next());
    }

    public void close() throws IOException {
      reader.close();
    }
  }

  public static void main(String[] args) throws IOException {
    try (ModuloSum instance = new ModuloSum()) {
      instance.solve();
    }
  }
}
