List Of Integers
Let's denote as L(x, p) an infinite sequence of integers y such that gcd(p, y) = 1 and y > x (where gcd is the greatest common divisor of two integer numbers), sorted in ascending order. The elements of L(x, p) are 1-indexed; for example, 9, 13 and 15 are the first, the second and the third elements of L(7, 22), respectively.You have to process t queries. Each query is denoted by three integers x, p and k, and the answer to this query is k-th element of L(x, p).
The first line contains one integer t (1 ≤ t ≤ 30000) — the number of queries to process.Then t lines follow. i-th line contains three integers x, p and k for i-th query (1 ≤ x, p, k ≤ 106).
Print t integers, where i-th integer is the answer to i-th query.
from sys import stdin
input = lambda : stdin.readline()[:-1]
m = 10 ** 6 + 10
use = [0] * m
query = []
for _ in range(int(input())):
    (x, p, k) = map(int, input().split())
    query.append((x, p, k))
    use[p] = 1
divs = [[] for i in range(m)]
p = list(range(m))
mebius = [0] * m
mebius[1] = 1
for i in range(2, m):
    if p[i] == i:
        for j in range(i * i, m, i):
            p[j] = i
        for j in range(i * i, m, i * i):
            p[j] = 0
    if p[i] != 0:
        mebius[i] = -mebius[i // p[i]]
        for j in range(i, m, i):
            if use[j]:
                divs[j].append(i)

def count(y, x_div):
    res = y
    for i in x_div:
        res += mebius[i] * (y // i)
    return res
for (x, p, k) in query:
    div = divs[p]
    c = count(x, div)
    (ng, ok) = (x, 10 ** 7)
    while ok - ng > 1:
        mid = (ok + ng) // 2
        if count(mid, div) - c >= k:
            ok = mid
        else:
            ng = mid
    print(ok)
from sys import stdin
input = lambda : stdin.readline()[:-1]
m = 10 ** 6 + 10
divs = [[1] for i in range(m)]
p = list(range(m))
p2 = [1] * m
mebius = [0] * m
mebius[1] = 1
for i in range(2, m):
    if p[i] == i:
        for j in range(i, m, i):
            p2[j] = i
        for j in range(i * i, m, i):
            p[j] = i
        for j in range(i * i, m, i * i):
            p[j] = 0
    if p[i] != 0:
        mebius[i] = -mebius[i // p[i]]

def make_div(n):
    now = [1]
    x = n
    while x != 1:
        q = p2[x]
        while x % q == 0:
            x //= q
        now = now + [i * q for i in now]
    return now

def count(y, x_div):
    res = 0
    for i in x_div:
        res += mebius[i] * (y // i)
    return res
for _ in range(int(input())):
    (x, p, k) = map(int, input().split())
    div = make_div(p)
    c = count(x, div)
    (ng, ok) = (x, 10 ** 7)
    while ok - ng > 1:
        mid = (ok + ng) // 2
        if count(mid, div) - c >= k:
            ok = mid
        else:
            ng = mid
    print(ok)
from sys import stdin
input = lambda : stdin.readline()[:-1]
m = 10 ** 6 + 10
divs = [[1] for i in range(m)]
p = list(range(m))
p2 = [1] * m
mebius = [0] * m
mebius[1] = 1
for i in range(2, m):
    if p[i] == i:
        for j in range(i, m, i):
            p2[j] = i
        for j in range(i * i, m, i):
            p[j] = i
        for j in range(i * i, m, i * i):
            p[j] = 0
    if p[i] != 0:
        mebius[i] = -mebius[i // p[i]]

def make_div(n):
    now = [1]
    x = n
    while x != 1:
        q = p2[x]
        e = 0
        while x % q == 0:
            e += 1
            x //= q
        e = min(e, 2)
        nxt = []
        for i in now:
            for j in range(e + 1):
                nxt.append(i * q ** j)
        now = nxt
    return now

def count(y, x_div):
    res = 0
    for i in x_div:
        res += mebius[i] * (y // i)
    return res
for _ in range(int(input())):
    (x, p, k) = map(int, input().split())
    div = make_div(p)
    c = count(x, div)
    (ng, ok) = (x, 10 ** 7)
    while ok - ng > 1:
        mid = (ok + ng) // 2
        if count(mid, div) - c >= k:
            ok = mid
        else:
            ng = mid
    print(ok)