#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==v.size()?"":" ");
    return os;
}
using int128=__int128;
 
ostream &operator<<(ostream &os,const __int128 n){
    if(n==0){
        os<<0;
        return os;
    }
    __int128 num=n;
    bool neg=false;
    if(num<0)neg=true,num=-num;
    string res="";
    while(num>0){
        res.push_back('0'+num%10);
        num/=10;
    }
    if(neg) res.push_back('-');
    reverse(begin(res),end(res));
    os<<res;
    return os;
}
 
istream &operator>>(istream &is,__int128 &n){
    string s;
    is>>s;
    int idx=0;
    bool neg=false;
    if(s[0]=='-')neg=true,idx++;
    n=0;
    for(;idx<(int)s.size();idx++){
        n=10*n+s[idx]-'0';
    }
    if(neg) n=-n;
    return is;
}
 
__int128 abs(__int128 x){
    return x<0?-x:x;
}
 
__int128 gcd(__int128 a,__int128 b){
    if(a==0) return b;
    if(b==0) return a;
    return b>0?gcd(b,a%b):a;
}
 
namespace fastprime{
    int128 pow_mod(int128 a,int128 n,int128 m){
        int128 ret=1;
        while(n){
            if(n&1)ret=ret*a%m;
            a=a*a%m;
            n>>=1;
        }
        return ret;
    }
 
    bool miller_rabin(int128 n){
        if(n<=1) return false;
        if(n==2) return true;
        if(n%2==0) return false;
        int128 d=n-1,s=0;
        while(!(d&1))d>>=1,s++;// n-1=2^s*d
        for(int128 a:{2,3,5,7,11,13,17,19,23,29,31,37}){
            if(n<=a) break;
            int128 y=pow_mod(a,d,n);// y=a^d (mod n)
            int128 t;
            for(t=d;t<n-1 and y!=1 and y!=n-1;t<<=1) y=y*y%n;
            if(y!=n-1 and t%2==0) return false;
        }
        return true;
    }
 
    int128 pollard_rho_single(int128 n){
        auto f=[&](int128 x){return (x*x+1)%n;};
        if(miller_rabin(n)) return n;
        if(!(n&1)) return 2;
        int128 a=0;
        while(true){
            a++;
            int128 x=a;
            int128 y=f(x);
            while(true){
                int128 g=gcd(y-x+n,n);
                if(g==0 or g==n) break;
                if(g!=1) return g;
                x=f(x);
                y=f(f(y));
            }
        }
    }
 
    vector<int128> pollard_rho(int128 n){
        if(n==1) return {};
        int128 x=pollard_rho_single(n);
        if(x==n) return {x};
        vector<int128> l=pollard_rho(x);
        vector<int128> r=pollard_rho(n/x);
        l.insert(l.end(),r.begin(),r.end());
        return l;
    }
}


void solve(){
    int128 a,p;cin>>a>>p;
    if(!fastprime::miller_rabin(p)){
        cout<<-1<<endl;
        return ;
    }
    if(a%p==0){
        cout<<0<<endl;
        return ;
    }
    cout<<1<<endl;
}


signed main(){
    int q;cin>>q;
    while(q--) solve();
    return 0;
}