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

    print(((X-2)//N+1)*X+(D-1)*(X-1)-1)