#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
using i128 = __int128_t;

// Compute x^e mod m using binary exponentiation
int64 mod_pow(int64 x, int64 e, int64 m) {
    i128 result = 1;
    i128 base = x % m;
    while (e > 0) {
        if (e & 1) {
            result = (result * base) % m;
        }
        base = (base * base) % m;
        e >>= 1;
    }
    return (int64)result;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T--) {
        int64 A, B, C;
        cin >> A >> B >> C;

        // r0 = A mod B
        int64 r0 = A % B;
        // M = 10 * B
        int64 M = B * 10;

        // Compute p = (10^C) mod M
        int64 p = mod_pow(10, C, M);

        // t = (r0 * p) mod M
        int64 t = (int64)((i128)r0 * p % M);

        // The C-th digit after the decimal point is floor(t / B)
        int64 digit = t / B;
        cout << digit << "\n";
    }

    return 0;
}