#include <bits/stdc++.h>

using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;

#define fi first
#define se second

const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);

void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

vector <int> Prime;
bool visited[int(5e6+5)], res[int(5e6+5)];

bool isPrime(int P){
  if (visited[P]) return res[P];
  visited[P] = true;

  if (P == 1) return false;

  for (int i = 0; i < Prime.size(); i++){
    if (P % Prime[i] == 0){
      return res[P] = false;
    } 
  }
  return res[P] = true;
}

ll A, P;

int Solve(){
  scanf("%lld%lld", &A, &P);

  if (!isPrime(P)){
    cout << -1 << endl;
  }else if (A % P == 0){
    cout << 0 << endl;
  }else{
    cout << 1 << endl;
  }
  return 0;
}

int main(){
  Prime.push_back(2);
  visited[2] = true; res[2] = true;
  for (int i = 3; i * i <= int(5e6); i+=2){
    visited[i] = true;
    res[i] = true;
    for (int j = 2; j * j <= i; j++){
      if (i % j == 0){
        res[i] = false; break;
      }
    }
    if (res[i]) Prime.push_back(i);   
  }

  int T; cin >> T;
  for (int i = 0; i < T; i++) Solve();


  return 0;
}