# Codeforeces 984 C. 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 ppqq and bb. You need to answer whether the result of p/qp/q in notation with base bb is a finite fraction.

A fraction in notation with base bb 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 nn (1n1051≤n≤105) — the number of queries.

Next nn lines contain queries, one per line. Each line contains three integers ppqq, and bb (0p10180≤p≤10181q10181≤q≤10182b10182≤b≤1018). All numbers are given in notation with base 1010.

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

612=12=0,510612=12=0,510

43=1,(3)1043=1,(3)10

936=14=0,012936=14=0,012

412=13=0,13412=13=0,13

2和5正好是10的两个因子（除了1和它本身）

1. 如果此时gcd(q, b) == 1，即q，b互质，则一定为无限小数
2. 否则，若gcd(q, b) ！= 1，就让q一直除gcd(q, b)，直到gcd(q, b) == 1
如果此时q==1，说明q只含有b的因子，可以转化为有限小数，反之不行。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
ll p, q, b;
int main()
{
int t;
while(~scanf("%d", &t))
{
while(t--)
{
scanf("%lld%lld%lld", &p, &q, &b);
ll gcd = __gcd(p, q);
q /= gcd;
while(q != 1)
{
gcd = __gcd(q, b);
if(gcd == 1) break;
while(q%gcd == 0) q /= gcd;
}
if(q == 1) printf("Finite\n");
else puts("Infinite");
}
}
return 0;
}