#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#endif
using namespace std;
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define FO(n) for(ll IJK=n;IJK-->0;)
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
#define multiple_testcases LL(T);FO(T)main2();}void main2(){
namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
using lll=__int128_t;
void lin(auto&...a){(cin>>...>>a);}
constexpr auto abs(auto x){return x<0?-x:x;}
constexpr ll size10(auto x){x|=1;ll r=0;while(x>0)x/=10,++r;return r;}
template<class T>constexpr ll maxsize10(){return size10(numeric_limits<T>::max());}
auto floor(auto x,auto y){if(y<0)x=-x,y=-y;return x>=0?x/y:(x+1)/y-1;}
bool amin(auto&a,const auto&b){return b<a?a=b,1:0;}
auto max(auto...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}
auto min(auto...a){return min(initializer_list<common_type_t<decltype(a)...>>{a...});}
template<class T,class U>common_type_t<T,U>gcd(T a,U b){return b?gcd(b,a%b):abs(a);}
auto binary_search(ll o,ll x,const auto&f){while(abs(o-x)>1)(f((o+x)/2)?o:x)=(o+x)/2;return o;}
template<bool is_negative=false>struct infinity{
  template<integral T>static constexpr T ones(size_t n){return n?ones<T>(n-1)*10+1:0;}
  template<integral T>constexpr operator T()const{return ones<T>(maxsize10<T>())*(1-is_negative*2);}
};
constexpr infinity oo;
}
namespace my{
template<class T=lll>T floor_sum(lll n,lll m,lll a,lll b){
  if(n<=0)return 0;
  if(a<0)return-floor_sum<T>(n,m,-a,-b+m-1);
  if(b<0)return floor_sum<T>(n,m,a,b*(1-m))+(T)b*n;
  if(a>=m||b>=m)return floor_sum<T>(n,m,a%m,b%m)+(T)(n-1)*n/2*(a/m)+(T)n*(b/m);

  if(a==0)return 0;
  return floor_sum<T>((a*n+b)/m,a,m,(a*n+b)%m);
}
}
namespace my{
template<class T=lll>T impl_ax_by_le_c_count(lll a,lll b,lll c,lll A,lll B,lll C,lll D){
  if(A>B||C>D)return 0;
  if(a<0)return impl_ax_by_le_c_count(-a,b,c,-B,-A,C,D);
  if(b<0)return impl_ax_by_le_c_count(a,-b,c,A,B,-D,-C);
  assert(a>=0);
  assert(b>=0);
  if(a>0&&b==0)return impl_ax_by_le_c_count(b,a,c,C,D,A,B);

  if(a==0){
    if(b==0)return c>=0?(B-A+1)*(D-C+1):0;
    else return (B-A+1)*max(min(floor(c,b),D)-C+1,0);
  }
  assert(a>0);
  assert(b>0);

  lll X=B-A,Y=D-C;
  c-=a*A+b*C;
  if(c<0)return 0;

  lll X2=min(X,floor(c,a));
  if(c-b*Y<0){
    return floor_sum<T>(X2+1,b,-a,c)+(X2+1);
  }else{
    lll Y2=floor(c-b*Y,a);
    amin(Y2,X2);
    return(Y2+1)*(Y+1)+(floor_sum<T>(X2+1,b,-a,c)-floor_sum<T>(Y2+1,b,-a,c))+(X2-Y2);
  }
}
template<class T=lll>T ax_by_le_c_count(lll a,lll b,lll c,lll A,lll B,lll C,lll D){return impl_ax_by_le_c_count(a,b,c,A,B-1,C,D-1);}
}
namespace my{entry
void main(){
  multiple_testcases
  LL(a,b,K);K++;
  ll g=gcd(a,b);
  a/=g,b/=g;

  ll X=binary_search(oo,0,[&](ll X){ // X以下でas+bt(0<=s<b,t>=0)表示できる非負整数がK個以上あるか
    return ax_by_le_c_count(a,b,X,0,b,0,1e12)>=K;
  });

  pp(X*g);
}}