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())
a = [int(i) for i in input().split()]
st = [0] * (m + 1)
en = [0] * (m + 1)
cnt = [0] *(m + 1)
st[0] = 1
for i in range(n):
    st[a[i] % m] = 1
    if a[i] % m == 0:
        print('YES')
        break
else:
    for i in range(1, n):
        for j in range(m + 1):
            en[j] = st[j]
            if not en[j] and st[j - a[i] % m]:
                en[j] = 1
        st = en.copy()
        en = cnt.copy()
    if st[m] == 1:
        print('YES')
    else:
        print('NO')