#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n,p;

uint power(uint pp,int K){
	uint ans = 1;
	while(K){
		if(K & 1) ans *= pp;
		pp *= pp;
		K /= 2;
	}
	return ans & ((1 << p) - 1);
}

void solve(){
	scanf("%d%d",&n,&p);
	if(n & 1){
		printf("1\n");
		return;
	}
	int answer = 0;
	uint cur = 1,temp;
	rep(k,1,p - 1){
		cur *= n;
		cur &= (1 << p) - 1;
		temp = power(k,n);
		if(!temp) answer--;
		if(temp == cur) answer++;
	}
	answer += 1 << (p - (p + n - 1) / n);
	printf("%d\n",answer);
}

int main(){
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}