#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;


void solve(){
    ll t;cin>>t;
    while(t--){
        ll a,b,c;cin>>a>>b>>c;
        vector<ll>s(0),used(10);
        a%=b;
        a*=10LL;
        if(a==0){
            cout<<0<<endl;
            continue;
        }
        ll la=-1;
        while(1){
            if(used[a/b]){
                la=a/b;
                break;
            }
            used[a/b]=1;
            s.pb(a/b);
            if(a==0)break;
            a%=b;
            a*=10LL;
        }
        if(used[0]){
            ll z=s.size();
            c--;
            if(c<z){
                cout<<s[c]<<endl;
            }else{
                cout<<0<<endl;
            }
        }else{
            c--;
            ll z=s.size();
            if(c<z){
                cout<<s[c]<<endl;
            }else{
                rep(i,z){
                    if(s[i]==la){
                        cout<<s[(c-i)%(z-i)+i]<<endl;
                        break;
                    }
                }
            }
        }
    }
}

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