#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e18;
const ll mod=1e9+7;

int main(){
    ll t;
    cin >> t;
    vector<ll> judge(5000000+1,-1);
    for(ll i=2;i<=5000000;i++){
        if(judge[i]==-1){
            judge[i]=0;
            for(ll j=2*i;j<=5000000;j+=i){
                judge[j]=1;
            }
        }
    }
    while(t--){
        ll a,p;
        cin >> a >> p;
        bool ok=false;
        if(judge[p]==0) ok=true;
        if(ok){
            if(a%p==0) cout << 0 << endl;
            else cout << 1 << endl;
            
        }
        else{
            cout << -1 << endl;
        }
    }
    return 0;
}