Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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 tag edit access

The problem statement has recently been changed. View the changes.

×
A. k-th divisor

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou 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* ≤ 10^{15}, 1 ≤ *k* ≤ 10^{9}).

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.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/30/2023 20:09:10 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|