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.util.StringTokenizer;
import java.util.Collections;
import java.util.Collection;
import java.util.Set;
import java.util.HashSet;
import java.util.Map;
import java.util.HashMap;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.Vector;
import java.util.Hashtable;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.*;
import java.math.*;

public class Main
{
	static PrintWriter writer;
	static StringTokenizer sz;
	static BufferedReader reader;

	public static void main(String[] args)
	throws IOException
	{
		declare();

		readLine();
		int n = readInt();
		int m = readInt();

		readLine();
		boolean flag[] = new boolean[m];
		ArrayList<Integer> set = new ArrayList<Integer>();
		int v,ans;

		for (int i=1;i <= n;++i)
		{
			v = readInt();
			for (int el:(ArrayList<Integer>)set.clone())
			{
				ans = (el + v) % m;
				if (ans == 0)
				{
					writer.print("YES");
					close();
					return;
				}
				else if (!flag[ans])
				{
					set.add(ans);
					flag[ans] = true;
				}
			}

			if ((ans = v % m) == 0)
			{
				writer.print("YES");
				close();
				return;
			}
			else
			if (!flag[ans])
			{
				set.add(ans);
				flag[ans] = true;
			}


		}

		writer.print("NO");
		close();
	}

	private static String readString()
	throws IOException
	{
		return reader.readLine();
	}

	private static void readLine()
	throws IOException
	{
		sz = new StringTokenizer(reader.readLine());
	}

	private static int readInt()
	throws IOException
	{
		return Integer.parseInt(sz.nextToken());
	}

	private static long readLong()
	throws IOException
	{
		return Long.parseLong(sz.nextToken());
	}

	private static void declare()
	{
		writer = new PrintWriter(System.out);
		reader = new BufferedReader(
			new InputStreamReader(System.in));
		sz = new StringTokenizer("");
	}

	private static void close()
	throws IOException
	{
		writer.flush();
		writer.close();
		reader.close();
	}
}

