/**
 *	author:	 fractal
 *	timus: 	 288481RF
 *	created: 04/21/21 10:29
**/

#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second 
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) (int)x.size()
#define len(x) (int)strlen(x)
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub upper_bound
#define lb lower_bound 
#define nl printf("\n");
#define clbuff fflush(stdin);

mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef set<int> si;
typedef set<ll> sll;
typedef set<pii> spii;
typedef set<pll> spll;
typedef multiset <int> msi;
typedef multiset <ll> msll;
typedef map <int, int> mi;
typedef map <ll, ll> mll;
 
const int N = 1e6 + 2;
const int M = 1e5;
const int mod = 0;
const int inf = 2e9 + 3;
const ll INF = 1e18;
const ld pi2 = 2.0 * 3.141592;
const ld pi = 3.141592;
const ld eps = 1e-12;

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};

void files(string s = "main") {
	#ifndef PC
		freopen((s + ".in").c_str(), "r", stdin);
		freopen((s + ".out").c_str(), "w", stdout);
	#endif
}

int add(int a, int b) {
	if (a + b < 0) return a + b + mod;
	if (a + b >= mod) return a + b - mod;
	return a + b;		
}

int mul(int a, int b) {
	return a * 1LL * b % mod;
}

int binpow(int a, int n) {
	int ret = 1;
	while (n) {
		if (n & 1) ret = mul(ret, a);
		a = mul(a, a);
		n >>= 1;
	}
	return ret;
}

int ans[120][120], L[120], K[120];

int ask1(int a, int b) {
	cout << "1 " << a << " " << b << endl;
	int ret;
	cin >> ret;
	assert(ret != -1);
	return ret;
}

int ask2(int v, vi &V) {
	assert(sz(V));
	cout << "2 " << v << " " << sz(V) << " ";
	for (auto i : V) cout << i << " ";
	cout << endl;
	int ret;
	cin >> ret;
	assert(ret != -1);
	return ret;
}

void rec(int l, int r, vi &C) {
	if (l == r) {
		C.pb(l);
		return;
	}
	vi A, B;
	int m = l + r >> 1;
	rec(l, m, A); rec(m + 1, r, B);
	int i = 0, j = 0;
	while (i != sz(A) && j != sz(B)) {
		if (ask1(A[i], B[j]))
			C.pb(A[i++]);
		else
			C.pb(B[j++]);
	}
	while (i < sz(A))
		C.pb(A[i++]);
	while (j < sz(B))
		C.pb(B[j++]);		
	
}
int main() {
	speed;
	int T, n;
	cin >> T;
	while (T--) {
		cin >> n;
		for (int i = 0; i < n; ++i) {
			L[i] = i;
			for (int j = 0; j < n; ++j) {
				ans[i][j] = 0;
			}
		}
		vi p, g;
		rec(0, n - 1, p);
		g = p;	
		for (int i = n - 1; i >= 0; --i) {
			while (sz(g) > i)
				g.ppb();
			if (sz(g) == 0)
				break;
			while (sz(g) && ask2(p[i], g)) {
				L[i] = min(L[i], sz(g) - 1);
				g.ppb();
			}
		}
		K[n - 1] = L[n - 1];
		for (int i = n - 2; i >= 0; --i)
			K[i] = min(L[i], K[i + 1]);
		for (int i = n - 1; i >= 0; --i) {
			int pos = i;
			for (int j = 1; j <= n; ++j) {
				pos = K[pos];
			}
			L[i] = pos;
		}
		for (int i = n - 1; i >= 0; --i) {
			for (int j = L[i]; j < n; ++j) {
				ans[p[i]][p[j]] = 1;
			}
		}
		cout << 3 << endl;
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				cout << ans[i][j];
			}
			cout << endl;
		}
		cin >> n;
	}
}
