#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");}

bool visited[int(5e6+5)], prime[int(5e6+5)];
ll A, P;

bool Judge(int num){
  if (visited[num]) return prime[num];
  visited[num] = true;
  for (int j = 2; j * j <= num; j++){
    if (num % j == 0){
      return prime[num] = false;
    }
  }
  return prime[num] = true;
}

int Solve(){
  cin >> A >> P;

  if (!Judge(P)){
    cout << -1 << endl;
    return 0;
  }

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

  return 0;
}

int main(){

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

  return 0;
}