Codeforces Beta Round 66
E
Morrowindows
Codeforces
2400
原题
← DF →
翻译中…

Vasya plays The Elder Trolls III: Morrowindows. He has a huge list of items in the inventory, however, there is no limits on the size of things. Vasya does not know the total amount of items but he is sure that are not more than $*x*$ and not less than $2$ items in his inventory. A new patch for the game appeared to view inventory in $*n*$ different modes. Displaying in mode $*i*$ is a partition of all inventory items on pages, each of which (except for maybe the last one) shows exactly $*a*_{*i*}$ items. In addition, each mode shows how many pages $*b*_{*i*}$ is in a complete list. Great! Perhaps this information will be enough for Vasya to find the required number. Moreover, it is very interesting, what is the fewest number of modes in which Vasya can see inventory to determine the number of items in it?

翻译中…

Vasya cannot use the information that was received while looking on inventory in some mode for selection of next actions. I. e. Vasya chooses some set of modes first, and then sees all the results and determines the size.

翻译中…

Knowing the number of $*a*_{*i*}$, $*x*$ and assuming that Vasya is very smart, check whether he can uniquely determine the number of items in his inventory, and how many modes he will need to do that if he knows numbers $*a*_{*i*}$, $*x*$ and he is able to know number $*b*_{*i*}$ after viewing items in mode $*i*$.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*x*$ ($0 ≤ *n* ≤ 10^{5}, 2 ≤ *x* ≤ 10^{9}$). The second line contains integers $*a*_{*i*}$ ($1 ≤ *a*_{*i*} ≤ 10^{9}$). Some numbers among all $*a*_{*i*}$ may be equal.

翻译中…

Output

翻译中…

Output the fewest amount of modes required to uniquely determine amount of items in the inventory. If there is no solution output $- 1$.

翻译中…

Note

翻译中…

In the second example Vasya is not able to determine items count uniquely because 3 items, as well as 4 items, can be displayed on two pages.

翻译中…

样例

Input #1
2 4
2 3
Output #1
2
InputCopy OutputCopy
Input #2
1 4
2
Output #2
-1
InputCopy OutputCopy
题目信息
题号
73E
时间限制
2 s
内存限制
256 MB
标签
数学
数论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。