#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int isPrime(int x){
  if(x<2) return 0;
  else if(x==2) return 1;
  if(x%2==0) return 0;
  for(int i=3;i*i<=x;i+=2){
    if(x%i==0) return 0;
  }
  return 1;
}

int main(){
  int t;
  cin>>t;
  
  while(t--){
    ll a,p;
    cin>>a>>p;
    
    if(!isPrime(p)){
      cout<<-1<<endl;
      continue;
    }
    
    if(a%p==0) cout<<0<<endl;
    else cout<<1<<endl;
  }
  
  return 0;
}