#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll maxn=20005;
ll q[maxn+5],p[maxn+5],deg[maxn+5];
bool isc[maxn+5];
vector<ll> s;
ll ask(ll i,ll j){printf("1 %lld %lld\n",i,j);fflush(stdout);ll res;scanf("%lld",&res);return res;}
int main(){
    ll t,n,i,j,k,zc1,zc2,idx1,idxN,dq,cnt;
    srand(time(0));
    scanf("%lld",&t);
    while(t--){
        scanf("%lld",&n);
        for(i=1;i<=n;i++)isc[i]=false,deg[i]=0,p[i]=0;
        s.clear();
        for(i=1;i<=n;i++)s.push_back(i);
        while(s.size()>1){
            zc1=s[rand()%s.size()];
            zc2=rand()%n+1;
            while(zc1==zc2)zc2=rand()%n+1;
            k=ask(zc1,zc2);
            if(k!=-1&&!isc[k]){
                isc[k]=true;
                for(i=0;i<s.size();i++)if(s[i]==k){s[i]=s.back();s.pop_back();break;}
            }
        }
        idx1=s[0];
        q[idx1]=1;
        idxN=-1;
        for(i=1;i<=n;i++){
            if(i==idx1)continue;
            k=ask(idx1,i);
            if(k==-1)idxN=i;
            else{p[i]=k;deg[k]++;}
        }
        dq=-1;
        for(i=1;i<=n;i++)if(i!=idx1&&deg[i]==0)dq=i;
        cnt=2;
        while(dq!=idxN&&dq!=0){
            q[dq]=cnt++;
            dq=p[dq];
        }
        if(idxN!=-1)q[idxN]=n;
        printf("2");
        for(i=1;i<=n;i++)printf(" %lld",q[i]);
        printf("\n");
        fflush(stdout);
    }
    return 0;
}