Vile Grasshoppers

Problem description

The weather is fine today and hence it's high time to climb the nearby pine and enjoy the landscape.

The pine's trunk includes several branches, located one above another and numbered from 2 to y. Some of them (more precise, from 2 to p) are occupied by tiny vile grasshoppers which you're at war with. These grasshoppers are known for their awesome jumping skills: the grasshopper at branch x can jump to branches .

Keeping this in mind, you wisely decided to choose such a branch that none of the grasshoppers could interrupt you. At the same time you wanna settle as high as possible since the view from up there is simply breathtaking.

In other words, your goal is to find the highest branch that cannot be reached by any of the grasshoppers or report that it's impossible.

Input

The only line contains two integers p and y (2 ≤ p ≤ y ≤ 10⁹).

Output

Output the number of the highest suitable branch. If there are none, print -1instead.

Examples

Input

3 6

3 4

Output

5

-1

Note

In the first sample case grasshopper from branch 2 reaches branches 2, 4 and 6 while branch 3 is initially settled by another grasshopper. Therefore the answer is 5.

It immediately follows that there are no valid branches in second sample case.

解题思路：给两个数 p,y,求区间(p,y]中不是[2,p]之间的倍数的最大数，明显可知如果存在这个数，那么它一定是不大于y的最大素数。因为在2~1e9的范围内相邻素数之差最大不超过1e3，所以最坏的时间为1e3∗sqrt(1e9)≈1e7，可以A过。

AC代码：

#include <bits/stdc++.h>
using namespace std;
int p,y;bool flag=false;
bool isprime(int x){
    for(int i=2;i*i<=x&&i<=p;++i)//注意最大因子至多为p
        if(x%i==0)return false;
    return true;
}
int main(){
    cin>>p>>y;
    for(int i=y;i>p;--i)
        if(isprime(i)){flag=true;cout<<i<<endl;break;}
    if(!flag)cout<<"-1"<<endl;
    return 0;
}