#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

ll modpow(ll a, ll n, ll m) {
	ll res = 1;
		while (n > 0) {
		if (n & 1) res = res * a % m;
		a = a * a % m;
		n >>= 1;
	}
	return res;
}

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int T;
	cin >> T;
	
	for (;T--;) {
		ll A, B, C;
		cin >> A >> B >> C;
		
		// A * 10^(C - 1) = B*P + Q
		ll Q = modpow(10, C - 1, B);
		Q = Q * A % B;
		
		cout << Q * 10 / B << '\n';
	}
}