cf 762 A (暴力枚举求第K大的因子）

A. k-th divisor

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

4 2

output

2

input

5 3

output

-1

input

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.

求给定数的第K大的因子；（n<1e15）

因为一个数的因子都可以在开平方后找到，所以可以暴力枚举

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cctype>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
typedef long long LL;
vector<LL>q;

int main()
{
    LL n, k;
    scanf("%lld %lld", &n, &k);
    for(LL i=1;i*i<=n;i++)
    {
        if(n%i==0)
        {
            q.push_back(i);
            if(i*i!=n) q.push_back(n/i);
        }
    }
    sort(q.begin(),q.end());
    if(k<=q.size())
        cout<<q[k-1];
    else
        printf("-1\n");
    return 0;
}