#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(a) a.begin(),a.end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define pb push_back #define debug(x) cerr << #x << ':' << x << '\n' #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair P; typedef complex com; constexpr int inf = 1000000010; constexpr ll INF = 1000000000000000010; constexpr ld eps = 1e-12; constexpr ld pi = 3.141592653589793238; template inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; } int N = 5000010; vector prime(N, 1); void init() { prime[0] = prime[1] = false; for (int i = 2; i < N; i++) { if (prime[i]) { for (int j = 2 * i; j < N; j += i) prime[j] = false; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); init(); int t; cin >> t; while (t--) { ll a, p; cin >> a >> p; if (!prime[p]) cout << "-1\n"; else if (a % p) cout << "1\n"; else cout << "0\n"; } }