#include <bits/stdc++.h> using namespace std; using ll=long long; using vin=vector<int>; using vll=vector<long long>; using vvin=vector<vector<int>>; using vvll=vector<vector<long long>>; using vstr=vector<string>; using vvstr=vector<vector<string>>; using vch=vector<char>; using vvch=vector<vector<char>>; using vbo=vector<bool>; using vvbo=vector<vector<bool>>; using vpii=vector<pair<int,int>>; using pqsin=priority_queue<int,vector<int>,greater<int>>; #define mp make_pair #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep2(i,s,n) for(int i=(s);i<(int)(n);i++) #define all(v) v.begin(),v.end() #define decp(n) cout<<fixed<<setprecision((int)n) const int inf=1e9+7; const ll INF=1e18; set<ll> prime; ll eratosthenes(ll x){ vbo isprime(x+1,true); isprime[0]=false; isprime[1]=false; ll p=0; for(ll i=2;i<=x;i++){ if(isprime[i]){ p++; prime.insert(i); for(ll j=2*i;j<=x;j+=i)isprime[j]=false; } } return p; } int main(){ int t;cin>>t; eratosthenes(5e6+10); ll a,p;vll ans; rep(i,t){ cin>>a>>p; if(!prime.count(p)){ ans.push_back(-1); continue; } a%=p; if(a==0)ans.push_back(0); else ans.push_back(1); } rep(i,ans.size())cout<<ans[i]<<endl; }