coderforce Finite or not?

C. Finite or not?

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given several queries. Each query consists of three integers $p$, $q$ and $b$. You need to answer whether the result of $p/q$ in notation with base $b$ is a finite fraction.

A fraction in notation with base $b$ is finite if it contains finite number of numerals after the decimal point. It is also possible that a fraction has zero numerals after the decimal point.

Input

The first line contains a single integer $n$ ($1\le n\le {10}^5$) — the number of queries.

Next $n$ lines contain queries, one per line. Each line contains three integers $p$, $q$, and $b$ ($0\le p\le {10}^{18}$, $1\le q\le {10}^{18}$, $2\le b\le {10}^{18}$). All numbers are given in notation with base $10$.

Output

For each question, in a separate line, print Finite if the fraction is finite and Infinite otherwise.

Examples

input

Copy

2
6 12 10
4 3 10

output

Copy

Finite
Infinite

input

Copy

4
1 1 2
9 36 2
4 12 3
3 5 4

output

Copy

Finite
Finite
Finite
Infinite

Note

$\frac{6}{12}=\frac{1}{2}=0,5_{10}$

$\frac{4}{3}=1,(3{)}_{10}$

$\frac{9}{36}=\frac{1}{4}=0,{01}_2$

$\frac{4}{12}=\frac{1}{3}=0,1_3$

题意：给你p,q让你判断在b进制下p/q是否为有限小数。

思路：

十进制小数转二进制，

如0.125，小数乘以进制取整数0，小数0.25乘以进制取整数0，小数0.5乘以进制取整数1，且乘到1停止

0.125对应  0.001  即0*（1/2）+0*（1/4）+1*（1/8）=0.125，回看过程，1/q*b*b....每次取整数，最后等于1。

这类似于b对q的约分，所以只要看q的质因子数是否包含在b中。

注意：在此之前要将p/q化为最简分数。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll x,ll y){
   ll z;
   while(x){
      z=y%x;
      y=x;
      x=z;
   }
   return y;
}
int main(){
    //freopen("data.in","r",stdin);
    int n;
    scanf("%d",&n);
    while(n--){
       ll p,q,d;
       scanf("%lld%lld%lld",&p,&q,&d);
       if(p==0||q==1){
         printf("Finite\n");
         continue;
       }
       ll g=gcd(p,q);
       p=p/g;
       q=q/g;

       while(q!=1&&d!=1){
            d=gcd(q,d);
          q=q/d;
       }
       if(q==1){
        printf("Finite\n");
       }else
        printf("Infinite\n");

    }
    return 0;
}