#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> Q; while(Q--){ ll X,N,d; cin >> X >> N >> d; if(g(X,d)!=1){ cout << "inf" << endl; continue; } ll k=(X-1)/N,r=(X-1)%N,a; if(r!=0) a=(k+1)*X+(k*N+r)*d; else a=k*X+k*N*d; cout << a-X << endl; } return 0; }