#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef vector vl; typedef vector vvl; typedef vector vc; typedef vector vs; typedef vector vb; typedef vector vd; typedef pair P; typedef pair pii; typedef vector

vpl; typedef tuple tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 5020000; ll dy[8] = {1,-1,0,0,1,-1,1,-1}; ll dx[8] = {0,0,1,-1,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template inline bool chmax(T1 &a,T2 b){ if(a inline void print(T &a){ rep(i,a.size()) cout << a[i] << " "; cout << "\n"; } template inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";} template inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } const int mod = 1e9 + 7; //const int mod = 998244353; int prime[MAX]; bool isprime[MAX]; int sieve(int n){ int p = 0; for(int i=0; i<=n; i++) isprime[i] = true; isprime[0] = isprime[1] = false; for(int i=2; i<=n; i++){ if(isprime[i]){ prime[p++] = i; for(int j=2*i; j<=n; j+=i) isprime[j] = false; } } return p; } ll modpow(ll x, ll n, ll mod){ ll res = 1; while(n > 0){ if(n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } int main(){ sieve(500000); ll t; cin >> t; while(t--){ ll a,p; cin >> a >> p; if(isprime[p]){ cout << modpow(a,p/2+1,p) << "\n"; }else{ cout << -1 << "\n"; } } }