You are given a sequence of numbers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>, and a number *m*.

Check if it is possible to choose a non-empty subsequence *a*<sub class="lower-index">*i*<sub class="lower-index">*j*</sub></sub> such that the sum of numbers in this subsequence is divisible by *m*.
The first line contains two numbers, *n* and *m* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>, 2 ≤ *m* ≤ 10<sup class="upper-index">3</sup>) — the size of the original sequence and the number such that sum should be divisible by it.

The second line contains *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (0 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
n, m = map(int, input().split())
arr = list(map(int, input().split()))

dp = [False] * (m)
for i in range(1, n + 1):
    mod_val = (arr[i- 1] % m)
    for j in range(m - 1, -1, -1):
        if(j == mod_val):
            dp[j] = True
        elif(j > mod_val):
            dp[j] = dp[j] or dp[j - mod_val] 
isDivisible = dp[0];
left, right = 1, m - 1
while(left < right):
    if(dp[left] and dp[right]):
        isDivisible = True
        break;
    left += 1
    right -= 1

print("YES" if(isDivisible) else "NO")