https://codeforces.com/problemset/problem/1245/A

Ax+By=1，A，B的gcd是1，他们就能凑出所有的数

 const int N = 200010;
int k[N];
int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}
void solve()
{
    int a, b;
    cin >> a >> b;
    if (a > b) swap(a, b);
    if (gcd(a, b) == 1) cout << "Finite" << '\n';
    else cout << "Infinite" << '\n';
}