#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  ll a, b, c; cin >> a >> b >> c;
  const ll g = gcd(a, b);
  a /= g; b /= g;
  a %= b;
  if (a == 0) {
    cout << 0 << '\n';
    return;
  }
  vector<ll> d{0};
  unordered_map<ll, int> rem{{a, 0}};
  for (int i = 1; ; ++i) {
    a *= 10;
    d.emplace_back(a / b);
    if (i == c) {
      cout << d.back() << '\n';
      return;
    }
    a %= b;
    if (rem.count(a)) break;
    rem[a] = i;
  }
  c -= rem[a];
  --c;
  cout << d[rem[a] + 1 + c % (d.size() - rem[a] - 1)] << '\n';
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}