codeforce 762 A. k-th divisor

题目链接：http://codeforces.com/contest/762/problem/A

You are given two integers n and k. Find k-th smallest divisor of n, or report that it doesn't exist.

Divisor of n is any such natural number, that n can be divided by it without remainder.

Input

The first line contains two integers n and k (1 ≤ n ≤ 1015, 1 ≤ k ≤ 109).

Output

If n has less than k divisors, output -1.

Otherwise, output the k-th smallest divisor of n.

Examples

input

Copy

4 2

output

2

input

Copy

5 3

output

-1

input

Copy

12 5

output

6

Note

In the first example, number 4 has three divisors: 1, 2 and 4. The second one is 2.

In the second example, number 5 has only two divisors: 1 and 5. The third divisor doesn't exist, so the answer is -1.

题意：求n的第k大约数，没有则输出-1

思路：可用一个vector来保存所有的约数，最后输出即可

代码：

#include<cstdio>
#include<cmath>
#include<vector>
#include<iostream>
#include<algorithm>
 
using namespace std;

typedef long long ll;

int main()
{
	std::ios::sync_with_stdio(false);
	ll n,k;
	vector<ll>v;
	v.clear();
	cin>>n>>k;
	for(ll i=1;i<=sqrt(n);i++)
	{
		if(n%i==0)
		{
			v.push_back(i);
			if(i*i!=n)
				v.push_back(n/i);
		}	
	}
	sort(v.begin(),v.end());
	if(v.size()<k)
		cout<<"-1"<<endl;
	else
		cout<<v.at(k-1)<<endl; 
	return 0;
}