// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>

using std::cin, std::cout, std::cerr;
using ll = long long;

const int N = 1e7;
int p[N];

int main() {
    std::iota(p, p + N, 0);
    for(int i = 2; i < N; i ++) if(p[i] == i) {
        for(int j = i * 2; j < N; j += i) {
            p[j] = p[j] == j ? i : p[j];
        }
    }
    std::ios::sync_with_stdio(false);
    
    int T; cin >> T;
    while(T --) {
        ll a, x; cin >> a >> x;
        if(x > 1 && p[x] == x) {
            cout << (a % x == 0 ? 0 : 1) << '\n';
        } else {
            cout << -1 << '\n';
        }
    }
}