#include<iostream>
#include<vector>
#include<atcoder/all>

using namespace std;

int action(int x,vector<int> a,int N){
    int y=0;
    for (int i=0; i<2*N; i++){
        if (x&(1<<i)) y|=1<<a[i];
    }
    return y;
}

int main(){
    int T,N,C;
    
    cin >> T;
    
    for (int tt=1; tt<=T; tt++){
        cin >> N >> C;
    
        atcoder::dsu U(1<<(2*N));
    
        vector<vector<int>> t(N, vector<int>(2*N,0)),u(N, vector<int>(2*N,0));
    
        // 2π/N 回転
        for (int i=0; i<N; i++){
            for (int j=0; j<N; j++){
                t[i][j]  =(i+j)%N;
                t[i][j+N]=t[i][j]+N;
            }
        }
    
        // ひっくり返す
        for (int i=0; i<N; i++){
            for (int j=0; j<N; j++){
                u[i][j+N]=(N-1)-j;
                u[i][j]  =u[i][j+N]+N;
            }
        }
    
        for (int S=0; S<(1<<(2*N)); S++){
            for (int i=0; i<N; i++){
                U.merge(S,action(S,t[i],N));
                U.merge(S,action(S,u[i],N));
            }
        }
    
        vector<vector<int>> G=U.groups();
    
        cout << G.size() << endl;
    }

}