#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)


ll mod_pow(ll x,ll n,ll mod) {
ll res=1;
  while(n>0) {
if(n&1) {
res=res*x%mod;
}
   x=x*x%mod;
    n>>=1;
  }
return res;
}


void solve() {
    ll A,B,C;cin>>A>>B>>C;
    A%=B;
    ll t=mod_pow(10,C-1,B);
    ll ans=(A*t)%B;
    cout<<ans*10/B<<endl;
}



int main() {

ll t;cin>>t;
for(ll i=0;i<t;i++) {
    solve();
}
}