#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=998244353;
// const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
void solve(){
      ll a,b,c;
      cin>>a>>b>>c;
      a%=b;
      int i=0,j=0;
      ll s=b;
      for(;s%2==0;i++)s/=2;
      for(;s%5==0;j++)s/=5;
      c--;
      for(int t=max(i,j);t>0;t--){
            if(c==0){
                  cout<<(10*a)/b<<"\n";
                  return;
            }
            a=(10*a)%b;
            c--;
      }
      if(s==1){
            cout<<0<<"\n";
            return;
      }
      V<ll> tmp;
      ll r=a;
      do {
            tmp.emplace_back((10*r)/b);
            r=(10*r)%b;
      } while(r!=a);
      int sz=tmp.size();
      cout<<tmp[c%sz]<<"\n";
}

int main(){
      int t;
      cin>>t;
      while(t--)solve();
}