You are given a sequence of numbers a 1, a 2, ..., a n , and a number m . Check if it is possible to choose a non-empty subsequence a i j such that the sum of numbers in this subsequence is divisible by m .
输入描述:
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).
输出描述:
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.
示例1
输入
3 5<br />1 2 3<br />1 6<br />5<br />4 6<br />3 1 1 3<br />6 6<br />5 5 5 5 5 5<br />
输出
YES<br />NO<br />YES<br />YES<br />
备注:
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.
加载中...