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.
from math import sqrt,gcd,ceil,floor,log,factorial
from itertools import permutations,combinations
from collections import Counter, defaultdict

def lcm(a,b):
    return (a*b)//gcd(a,b)
    
n,m = map(int,input().split())
a = list(map(int,input().split()))

mod = list(map(lambda x: x%m,a))
#print(*mod)

if 0 in mod:
    print('YES')
    
else:
    d=Counter(mod)
    
    flag=0
    
    for key in d:
        if d[key]>=lcm(key,m)//key:
            print('YES')
            flag=1
            break
    
    if flag==0:
        for i in range(1,m//2+1):
            if m%2==0 and i==m//2:
                if d[key]>1:
                    print('YES')
                    flag=1
                    break
                
            else:
                if d[m-key]>0:
                    print('YES')
                    flag=1
                    break
                
        if flag==0:
            mod.sort()
            ans=set()
            for i in mod:
                res=set()
                res.add(i%m)
                for el in ans:
                    res.add((i+el)%m)
                    
                ans=ans|res
                
            if 0 in ans:
                print('YES')
                
            else:
                print('NO')
        