#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
//const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

int main() {
    const ll max_sqrt = 2240;
    vec prime(0), memo(max_sqrt, 1);
    reps(i, 2, max_sqrt){
        if(memo[i]){
            prime.push_back(i);
            for(int j = i * 2; j < max_sqrt; j += i) memo[j] = 0;
        }
    }
    cout<<prime[330]<<endl;
    cin>>N;
    rep(i,N){
        bool flag = true;
        scanf("%lld %lld", &A, &K);
        for(ll p : prime){
            if(p*p > K) break;
            if(K%p == 0){
                flag = false;
                break;
            }
        }
        int res = (A%K == 0 ? 0 : 1);
        printf("%d\n", flag ? res : -1);
    }
}