#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=1000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

//二分累乗

ll rui(ll a,ll b,ll mod){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x%mod;
        x=x*x%mod;
        b/=2;
    }
    return res;
}

//gcd
ll gcd(ll a,ll b){
    if(b==0)return a;
    return gcd(b,a%b);
}

void solve(){
    ll t;cin>>t;
    while(t--){
        ll a,b,c;cin>>a>>b>>c;
        ll g=gcd(a,b);
        a/=g;
        b/=g;
        bool f=0;
        while(b%2==0||b%5==0){
            if(c==0){
                f=1;
                break;
            }
            a*=10LL;
            ll g=gcd(a,b);
            a/=g;
            b/=g;
            c--;
        }
        if(f){
            cout<<0<<endl;
            continue;
        }else if(c==0){
            cout<<(a/b)%10<<endl;
            continue;
        }
        c--;
        ll x=a*rui(10,c,b)%b;
        cout<<x*10LL/b<<endl;
    }
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}