#include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 long long T,n,m,b,g;

 long long gcd(long long a,long long b)

 {

     return b?gcd(b,a%b):a;

 }

 int main ()

 {

     scanf("%lld",&T);

     while(T--)

     {

         scanf("%lld%lld%lld",&n,&m,&b);

         if(!(n%m)) {printf("Finite\n"); continue ;}

         g=gcd(n,m),m/=g;

         while(m>)

         {

             g=gcd(b,m);

             if(g==) break;

             while(!(m%g)) m/=g;

         }

         m>?printf("Infinite\n"):printf("Finite\n");

     }

     return ;

 }