#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;

int main(){
    ll T;
    cin >> T;
    vector<bool> isPrime(5000005, true);
    isPrime[1] = false;
    for (ll i = 2; i <= 5000004; i++){
        if (isPrime[i]){
            for (ll j = 2; j * i <= 5000004; j++){
                isPrime[j * i] = false;
            }
        }
    }
    rep(i,T){
        ll A,P;
        cin >> A >> P;
        if (!isPrime[P]) cout << -1 << endl;
        else{
            if (A % P == 0) cout << 0 << endl;
            else cout << 1 << endl;
        }
    }
}