#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
#define rep(i,a) for (ll i=0;i<a;i++)

//return x^y (mod z)
ll my_pow(ll x,ll y,ll z){
	if(x==0) return 0;
	if(y==0) return 1;
	if(y%2==1) return (x*my_pow(x,y-1,z))%z;
	return my_pow((x*x)%z,y/2,z);
}

int MAX_T=100000;
int MAX_A=1000000000;

void solve();

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t;
	cin>>t;
	assert(1<=t&&t<=MAX_T);
	rep(i,t) solve();
}

void solve(){
	ll A,B,C;
	cin>>A>>B>>C;
	assert(1<=A&&A<=MAX_A);
	assert(1<=B&&B<=MAX_A);
	assert(1<=C&&C<=MAX_A);
	ll Y=(A*my_pow(10,C-1,B))%B;
	cout<<(Y*10ll)/B<<"\n";
	return ;
}