codeforce 483C

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$

若q中含有与b互素的因子，则无限循环。反之，则当k足够大时，b^k会是q的倍数，则为有限小数。

#include<iostream>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<map>
#include<string>
#include<stdio.h>
#include<vector>
#include<string>
#include<time.h>
#include<stack>
using namespace std;
#define LL long long int
#define mod 1000000007
#define MAX(x, y) (x) > (y) ? (x) : (y)
using namespace std;
int n;
int m;
int dir[8][2] = { 1,0,0,1,-1,0,0,-1,1,1,-1,1,1,-1,-1 ,-1 };

LL gcd(LL a, LL b) {
	return b == 0 ? a : gcd(b, a%b);
}
int main()
{
	ios::sync_with_stdio(false);
	int n;
	LL a, b, c;
	cin >> n;
	while (n--) {
		cin >> a >> b >> c;
		LL g = gcd(a, b);
		a /= g;
		b /= g;
		while (b != 1 && c != 1) {
			c = gcd(b, c);
			b /= c;
		}
			if (b==1) {
				cout << "Finite" << endl;
			}
			else {
				cout << "Infinite" << endl;
			}
	}
	return 0;
}