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.
import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;

public class ModuloSum {
	private static final InputReader in = new InputReader(System.in);

	public void solve() throws IOException {
		int n = in.readInt();
		int m = in.readInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = (in.readInt()) % m;
		}
		boolean[] res = new boolean[m];
		boolean possible = false;
		
		for (int i = 0; i < n; i++) {
			if (a[i] == 0) {
				possible = true;
				break;
			}
			
			if (res[m - a[i]]) {
				possible = true;
				break;
			}
			else {
				boolean[] newRes = new boolean[m];
				for (int j = 0; j < m; j++) {
					if (res[j]) {
						newRes[j] = true;
						newRes[(j + a[i]) % m] = true;
					}
				}
				newRes[a[i]] = true;
				res = newRes;
			}
		}
		System.out.println(possible ? "YES" : "NO");
	}
	
	public static void main(String[] args) throws IOException {
		new ModuloSum().solve();
	}
	
	@SuppressWarnings("unused")
	private static class InputReader {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private SpaceCharFilter filter;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public void readIntArray(int[] a) {
			for (int i = 0; i < a.length; i++) {
				a[i] = this.readInt();
			}
		}

		public int readInt() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
}
