数论——Codeforces-984C - 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$

1. #include<bits/stdc++.h>
   using namespace std;
   typedef long long ll;
   #define gcd __gcd           
   
   int main()
   {
       ll T,p,q,b;
       scanf("%lld",&T);
       while(T--){
           scanf("%lld%lld%lld",&p,&q,&b);
           ll t=gcd(p,q);
           q/=t;
           t=b;
           while(q!=1){
               t=gcd(q,t);
               q/=t;
               if(t==1)break;
           }
           if(q==1){
               printf("Finite\n");
           }else{
               printf("Infinite\n");
           }
       }
       return 0;
   }

   
   

参考：https://blog.csdn.net/xs18952904/article/details/80331434

https://blog.csdn.net/z_sea/article/details/80334032

https://www.guokr.com/question/487631/