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

long long mod = 1000000007;
vector<bool> vp;
vector<long long> vk(5000001);

// ------------------------------
// 素数列挙
// 参考：https://ei1333.github.io/luzhiled/snippets/math/prime-table.html
void prime_table(long long n) {
  vector<bool> prime(n+1, true);
  if(n >= 0) prime[0] = false;
  if(n >= 1) prime[1] = false;
  for(long long i = 2; i*i <= n; ++i) {
    if(!prime[i]) continue;
    for(long long j = i+i; j <= n; j += i) {
      prime[j] = false;
    }
  }
  vp = prime;
}
// ------------------------------

void kaijou() {
    vk[0] = 1;
    for(long long i = 1; i <= 5000000; ++i) vk[i] = (vk[i-1]*i)%mod;
}

// ------------------------------
// 繰り返し二乗法
// 参考：https://math.nakaken88.com/textbook/cp-binary-exponentiation-and-recursive-function/
long long modPow(long long a, long long n, long long p) {
  if (n == 0) return 1;
  if (n == 1) return a % p;
  if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
  long long t = modPow(a, n / 2, p);
  return (t * t) % p;
}
// ------------------------------

int main() {

    // あらかじめ素数テーブルと階乗テーブルを作成
    // ちゃんとmodを取っておく
    prime_table(5000000);
    kaijou();

    long long t;
    cin >> t;

    for(long long i = 0; i < t; ++i) {
        long long a;
        long long p;
        scanf("%lld %lld", &a, &p);
        if(vp[p]) {
            //long long ans = modPow((a%p), vk[p], p);
            long long ans = (a%p)? 1 : 0;
            printf("%lld\n", ans);
        }
        else {
            printf("-1\n");
        }
    }
}