#include <bits/stdc++.h>
using namespace std;
const long long M = 1e5 + 7;
const long long MOD = 1e9 + 7;
vector<long long> ngto;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  long long p, q, d;
  cin >> p >> q >> d;
  long long x = gcd(p, q);
  q /= x;
  for (auto i : ngto)
    if (d % i == 0)
      while (q % i == 0 && q) q /= i;
  do {
    x = gcd(q, d);
    q /= x;
  } while (x != 1);
  if (q <= 1)
    cout << "Finite\n";
  else
    cout << "Infinite\n";
}
int main() {
  ios::sync_with_stdio(0);
  int n;
  long long x = 1;
  while (ngto.size() < 20) {
    x++;
    for (int i = (2); i <= (sqrt(x)); i++)
      if (x % i == 0) continue;
    ngto.push_back(x);
  }
  cin >> n;
  while (n--) solve();
  return 0;
}
