#include <bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ddx[] = {0, 0, 1, 1, 1, -1, -1, -1}, ddy[] = {1, -1, 1, 0, -1, 1, 0, -1};
int main() {
  int n;
  scanf("%d", &n);
  while (n--) {
    long long p, q, d;
    scanf("%lld%lld%lld", &p, &q, &d);
    if (p == 0) {
      puts("Finite");
      continue;
    }
    q /= gcd(p, q);
    if (d % q == 0) {
      puts("Finite");
      continue;
    }
    while (1) {
      long long t = gcd(q, d);
      if (t == 1) break;
      while (q % t == 0) q /= t;
    }
    if (d % q == 0)
      puts("Finite");
    else
      puts("Infinite");
  }
}
