#include "bits/stdc++.h" using namespace std; #define int long long #define REP(i, n) for (int i = 0; i < (int)n; ++i) #define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i) #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i) #define ALL(a) a.begin(), a.end() #define IN(a, x, b) (a <= x && x < b) templateinline void out(T t){cout << t << "\n";} templateinline void out(T t,Ts... ts){cout << t << " ";out(ts...);} templateinline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;} templateinline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;} constexpr int INF = 1e18; #define endl '\n' #define IOS() ios_base::sync_with_stdio(0);cin.tie(0) const int M = 5650131; int P[M]; int invP[M + 1]; int minP[M + 1]; bool isP[M + 1]; void Eratosthenes() { int p = 0; REP(i, M + 1) isP[i] = true, minP[i] = -1; isP[0] = isP[1] = false; minP[0] = 0; minP[1] = 1; FOR(i, 2, M + 1) { if (isP[i]) { minP[i] = i; P[p] = i; invP[i] = p++; for (int j = i * 2; j < M; j += i) { isP[j] = false; if (minP[j] == -1) minP[j] = i; } } } } void solve(){ int A, P; cin >> A >> P; if(!isP[P]) { out(-1); return; } out(A % P == 0); } signed main(){ IOS(); Eratosthenes(); int Q = 1; cin >> Q; while(Q--)solve(); }