#include using namespace std; #define int long long #define REP(i,m,n) for(int i=(m);i<(n);i++) #define rep(i,n) REP(i,0,n) #define pb push_back #define all(a) a.begin(),a.end() #define rall(c) (c).rbegin(),(c).rend() #define mp make_pair #define endl '\n' //#define vec vector //#define mat vector > #define fi first #define se second #define double long double typedef long long ll; typedef unsigned long long ull; typedef pair pll; //typedef long double ld; typedef complex Complex; const ll INF=1e9+7; const ll MOD=998244353; const ll inf=INF*INF; const ll mod=MOD; const ll MAX=200010; const double PI=acos(-1.0); typedef vector > mat; typedef vector vec; void solve(){ ll t;cin>>t; while(t--){ ll n,c;cin>>n>>c; vectora(1<<(2*n)); ll cnt=0; rep(i,1<<(2*n)){ if(a[i]==1)continue; cnt++; ll x=i; a[x]=1; rep(j,n){ ll z=x%4; x/=4; x+=(1<<(2*(n-1)))*z; a[x]=1; } ll y=i; x=0; rep(j,2*n){ x*=2; x+=y%2; y/=2; } a[x]=1; rep(j,n){ ll z=x%4; x/=4; x+=(1<<(2*(n-1)))*z; a[x]=1; } } cout<