#include using namespace std; #include using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; using ll = long long; using ld = long double; using pll = pair; using tlll = tuple; constexpr ll INF = 1LL << 60; template bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {return (A % M + M) % M;} ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);} template void unique(vector &V) {V.erase(unique(V.begin(), V.end()), V.end());} template void sortunique(vector &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) ll modpow(ll a, ll n, ll m) { a %= m; ll ret = 1 % m; while (n > 0) { if (n % 2 == 1) ret = ret * a % m; a = a * a % m; n /= 2; } return ret; } ll solve(ll A, ll B, ll C) { ll x = A * modpow(10, C - 1, B) % B; ll ans = (10 * x / B) % 10; return ans; } int main() { ll T; cin >> T; for (ll t = 0; t < T; t++) { ll A, B, C; cin >> A >> B >> C; cout << solve(A, B, C) << endl; } }