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>).
x,y = map(int, input().split())
l = list(map(int, input().split()))
s=l[0]
ch='NO'
if y in l:
  ch='YES'
else:
  for i in range(1,len(l)-1):
    s=s+l[i]+l[i+1]
    if (y%s==0 or s%y==0):
      ch='YES'
      break
    else:
      s=s-l[i-1]
      if (y%s==0 or s%y==0):
        ch='YES'
        break
print(ch)