#include <bits/stdc++.h>
using namespace std;
int N;
long long int p, q, b, pot[70], aux;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  scanf("%d", &N);
  while (N--) {
    scanf("%I64d %I64d %I64d", &p, &q, &b);
    if (p % q == 0) {
      printf("Finite\n");
      continue;
    }
    aux = gcd(min(p, q), max(p, q));
    q /= aux;
    while (true) {
      if (q == b) {
        printf("Finite\n");
        break;
      } else if (q > b) {
        aux = gcd(b, q);
        if (aux == 1LL) {
          printf("Infinite\n");
          break;
        }
        while (q % aux == 0) q /= aux;
        if (q == 1) {
          printf("Finite\n");
          break;
        }
      } else {
        aux = gcd(q, b);
        if (aux == 1LL) {
          printf("Infinite\n");
          break;
        } else if (aux == q) {
          printf("Finite\n");
          break;
        }
        while (q % aux == 0) q /= aux;
        if (q == 1) {
          printf("Finite\n");
          break;
        }
      }
    }
  }
}
