#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
    return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
    return a > b && (a = b, true);
}
/*-------------------------------------------*/

bool prime[5000001];

void init() {
    FOR(i, 2, 5000001) prime[i] = true;
    for(int i = 2; i < 5000001; i++)
        if(prime[i])
            for(int j = i + i; j < 5000001; j += i)
                prime[j] = false;
}

ll solve(ll a, ll p) {
    if(!prime[p]) return -1;
    return a % p != 0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    init();

    int t;
    cin >> t;
    while(t--) {
        ll a, p;
        cin >> a >> p;
        cout << solve(a, p) << "\n";
    }

    return 0;
}