Good ol' Numbers Coloring

Consider the set of all nonnegative integers: 0,1,2,…0,1,2,…. Given two integers aa and bb (1≤a,b≤1041≤a,b≤104). We paint all the numbers in increasing number first we paint 00, then we paint 11, then 22 and so on.

Each number is painted white or black. We paint a number ii according to the following rules:

• if i=0i=0, it is colored white;
• if i≥ai≥a and i−ai−a is colored white, ii is also colored white;
• if i≥bi≥b and i−bi−b is colored white, ii is also colored white;
• if ii is still not colored white, it is colored black.

In this way, each nonnegative integer gets one of two colors.

For example, if a=3a=3, b=5b=5, then the colors of the numbers (in the order from 00) are: white (00), black (11), black (22), white (33), black (44), white (55), white (66), black (77), white (88), white (99), ...

Note that:

• It is possible that there are infinitely many nonnegative integers colored black. For example, if a=10a=10 and b=10b=10, then only 0,10,20,300,10,20,30 and any other nonnegative integers that end in 00 when written in base 10 are white. The other integers are colored black.
• It is also possible that there are only finitely many nonnegative integers colored black. For example, when a=1a=1 and b=10b=10, then there is no nonnegative integer colored black at all.

Your task is to determine whether or not the number of nonnegative integers colored black is infinite.

If there are infinitely many nonnegative integers colored black, simply print a line containing "Infinite" (without the quotes). Otherwise, print "Finite" (without the quotes).

Input

The first line of input contains a single integer tt (1≤t≤1001≤t≤100) — the number of test cases in the input. Then tt lines follow, each line contains two space-separated integers aa and bb (1≤a,b≤1041≤a,b≤104).

Output

For each test case, print one line containing either "Infinite" or "Finite" (without the quotes). Output is case-insensitive (i.e. "infinite", "inFiNite" or "finiTE" are all valid answers).

Example

input

Copy

4
10 10
1 10
6 9
7 3

output

Copy

Infinite
Finite
Infinite
Finite

思路:根据题目描述，设当前位置之前的所有白色数中任意两个为x和y，只要当前位置的数可以由ax+by表示，那就是白色的（a，b为任意常数）       

结论：ax+by=k*gcd（a，b）；k号位置是白色的就是ax+by有整数解k，如果有有限个黑色的，只要gcd（a，b）=1，那从某个位置开始之后的所有位置能满足当前位置编号是整数解，即白色，black就是有限的；否则就是无限的。

完整代码:

#include <bits/stdc++.h>
#define int long long
using namespace std;
int gcd(int x,int y){return x%y?gcd(y,x%y):y;}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t,a,b;
    cin>>t;
    while(t--)
    {
        cin>>a>>b;
        if(gcd(a,b)==1){
            cout<<"Finite"<<endl;
        }
        else{
            cout<<"Infinite"<<endl;
        }
    }
    return 0;
}