#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,l,r) for(ll i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
const ll INF = 1e18;

vector<bool> isprime(5000010, false);

void make_table(){
    for(int i = 2; i <= 5000000; i++) isprime[i] = true;
    for(int i = 2; i <= 5000000; i++) if(isprime[i]) for(int j = 2 * i; j <= 5000000; j += i) isprime[j] = false;
}

int main(){
    make_table();
    ios::sync_with_stdio(false);\
    cin.tie(nullptr);
    int n;
    cin >> n;
    assert(n > 0 and n <= 500000);
    REP(i, n){
        ll a, p; cin >> a >> p;
        assert(a > 0 and a <= INF);
        assert(p > 0 and p <= 5000000);
        if(!isprime[p]) cout << -1 << endl;
        else cout << (a % p ? 1 : 0) << endl;
    }
}