from sys import stdin
input = stdin.readline
from math import gcd

def inverse(n, d, MOD):
    return n * pow(d, -1, MOD) % MOD

for _ in range(int(input())):
    X, N, D = map(int, input().split())

    if gcd(X, D) != 1:
        print("inf")
        continue
    if X == 1:
        print(-1)
        continue

    x = inverse(X-1, D, X)
    left = 0
    right = 10**9
    while left+1 < right:
        mid = (left+right)//2
        nex = (mid*X+x)-((X-1)*D)
        if ((X-1)+N-1)//N <= nex//X:
            right = mid
        else:
            left = mid
    
    print(X*left+x)