Codeforces Round #319 (Div. 2) B. Modulo Sum

B. Modulo Sum

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a sequence of numbers a₁, a₂, ..., a_n, and a number m.

Check if it is possible to choose a non-empty subsequence a_ij 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 ≤ 10⁶, 2 ≤ m ≤ 10³) — the size of the original sequence and the number such that sum should be divisible by it.

The second line contains n integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹).

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.

dp[i][j]表示前i个数mod m余数为j时值为1 。n>m时根据抽屉原理直接YES

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+100;
int dp[N][N];
int a[1000005];
int main()
{
    memset(dp,0,sizeof(dp));
    int n,m;
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    if(n>m)
    {
        return 0*puts("YES");
    }
    else
    {
        for(int i=1; i<=n; i++)
        {
            dp[i][a[i]%m]=1;
            for(int j=0; j<=m-1; j++)
            {
                dp[i][(a[i]%m+j)%m]|=dp[i-1][j];
                dp[i][j]|=dp[i-1][j];
            }
        }
        if(dp[n][0])
            return 0*puts("YES");
        else
            return 0*puts("NO");
    }
}