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.
n,m=map(int,raw_input().split())
lst=map(int,raw_input().split())
ans=0
if n>=m:
    ans=1
else:
    for i in range(0,n):
        lst[i]=lst[i]%m
    dp=[]
    #print lst
    for i in range(0,n+1):
        l=[]
        for j in range(0,m+1):
            l.append(0)
        dp.append(l)
    #dp[0][0]=1
   # for i in range(0,n):
    #    dp[lst[i]][lst[i]]=1
    for i in range(1,n+1):
        for j in range(0,m+1):
            if j==lst[i-1]:
                dp[i][(lst[i-1])%m]=1
            #if j==lst[i-1]:
               # dp[i][j]=0
       #     if j==0 :
       #         dp[i][j]=0
            if 1==1:
                if 1==1:
                    dp[i][j%m]|=dp[i-1][j%m]|dp[i-1][(j-lst[i-1]+m)%m]
                else:
                    dp[i][j%m]|=dp[i-1][j%m]

    #@print dp
    if dp[n][0]==1 or 0 in lst:
        ans=1
if ans==1:
    print "YES"
else:
    print "NO"