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 = list(map(int, input().split()))
arr = list(map(int, input().split()))

# t = int(input())
dp = [[False] * (m+1) for i in range(n+1)]

for i in range(n+1):
    dp[i][0] = True
    
if sum(arr) % m == 0:
    print("YES")
    exit()

for i in range(1,n+1):
    for j in range(1,m+1):
        dp[i][j] = dp[i][j] or dp[i-1][j] or arr[i-1] == j
        if j >= arr[i-1] % m:
            dp[i][j] = dp[i][j] or dp[i-1][j - arr[i-1]%m]
if dp[n][m]: print("YES")
else: print("NO")