Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tags yet

No tag edit access

D. Numbers

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou have a sequence of *n* distinct integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*). You want to remove some integers in such a way that the resulting sequence of integers satisfies the following three conditions:

- the resulting sequence is not empty;
- the exclusive or (
*xor*operation) of all the integers in the resulting sequence equals 0; - if you write all the integers of the resulting sequence (from beginning to the end) in a row in the decimal numeral system and without any spaces, the written number is divisible by
*p*.

You are given the sequence of *n* integers *a* and a prime number *p*, find a way to satisfy the described conditions.

Input

The first line of the input contains two integers *n* and *p* (1 ≤ *n*, *p* ≤ 50000). Next line contains *n* space-separated distinct integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*).

It is guaranteed that *p* is a prime number.

Output

If there is no solution for the given input, print "No" (without quotes) in the only line of the output.

Otherwise print "Yes" in the first line of output. The second line should contain an integer *k* (*k* > 0) specifying the number of remaining elements and the third line should contain *k* distinct integers *x*_{1}, *x*_{2}, ..., *x*_{k} (1 ≤ *x*_{i} ≤ *n*). These integers mean that you should remove all integers from the sequence except integers *a*_{x1}, *a*_{x2}, ..., *a*_{xk} to satisfy the described conditions.

If there are multiple solutions, any of them will be accepted.

Examples

Input

3 3

1 2 3

Output

Yes

3

1 2 3

Input

3 5

1 2 3

Output

No

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/26/2017 12:10:23 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|