#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

#define NMAX 5000100
bool primes[NMAX];

ll mod_pow(ll a, ll n, ll mod){
    ll ret = 1;
    while(n > 0){
        if(n & 1) ret = (ret*(a % mod))%mod;
        a = ((a%mod)*(a%mod)) % mod;
        n = n >> 1;
    }
    return ret;
}
int main(){
    rep(i, 2, NMAX) primes[i] = true;
    rep(i, 2, NMAX) {
        for(ll j = i * 2; j <= NMAX; j += i) primes[j] = false;
    }
    ll T = 0;
    cin >> T;
    rep(test, 0, T){
        ll a, p;
        cin >> a >> p;
        if(!primes[p]) {
            cout << -1 << endl;
            continue;
        }
        ll ans = mod_pow(a, p * (p+1) / 2, p);
        cout << ans << endl;
    }
    return 0;
}