Codeforces Round #483 (Div. 2) C. Finite or not?(数论,GCD)

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,询问在b进制下,p/q是否为无限小数。

题解:首先想到的是在十进制下p/q何时为无限小数,发现当分式最简的时候,分母的因子只存在10的质因子时,一定不是无限小数,反之则是无限小数,则推广到b,将q中所有b的因子除掉,看是否可以将q完全除掉即可。

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<algorithm>
#define gcd(a,b) __gcd(a,b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FAST_IO ios::sync_with_stdio(false)
#define mem(a,b) memset(a,b,sizeof(a))
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX=1e5+10;
const long long INF=0x7FFFFFFFFFFFFFFFLL;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
typedef long long ll;
using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        ll p,q,b;
        scanf("%I64d %I64d %I64d",&p,&q,&b);
        ll GCD=b;
        q/=gcd(p,q);

        while(q!=1)
        {
            GCD=gcd(GCD,q);
            if(GCD==1) break;
            q/=GCD;
        }

        if(q==1) printf("Finite\n");
        else printf("Infinite\n");
    }
    return 0;
}