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

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

(1n105

) — the number of queries.

Next n

lines contain queries, one per line. Each line contains three integers p, q, and b (0p1018, 1q1018, 2b1018). 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
2
6 12 10
4 3 10

Output
Finite
Infinite

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

Output
Finite
Finite
Finite
Infinite

Note

612=12=0,510

43=1,(3)10

936=14=0,012

412=13=0,13

#include<stdio.h>

int n;
__int64 a,b,c,s,t;

__int64 get_gcd(__int64 u,__int64 v)
{
if(v==0) return u;
return get_gcd(v,u%v);
}

int main()
{
while(~scanf("%d",&n))
{
while(n--)
{
scanf("%I64d%I64d%I64d",&a,&b,&c);
s=get_gcd(a,b);
a/=s;
b/=s;
while(b!=1 && c!=1)
{
c=get_gcd(b,c);
b/=c;
}
if(b==1) printf("Finite\n");
else printf("Infinite\n");
}
}
return 0;
}


• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120