Problem: This is an interactive problem.

Baby Ehab loves crawling around his apartment. It has n rooms numbered from 0 to n-1. For every pair of rooms, a and b, there's either a direct passage from room a to room b, or from room b to room a, but never both.

Baby Ehab wants to go play with Baby Badawy. He wants to know if he could get to him. However, he doesn't know anything about his apartment except the number of rooms. He can ask the baby sitter two types of questions: 

  * is the passage between room a and room b directed from a to b or the other way around? 
  * does room x have a passage towards any of the rooms s_1, s_2, ..., s_k? 



He can ask at most 9n queries of the first type and at most 2n queries of the second type.

After asking some questions, he wants to know for every pair of rooms a and b whether there's a path from a to b or not. A path from a to b is a sequence of passages that starts from room a and ends at room b.

Input

The first line contains an integer t (1 ≤ t ≤ 30) — the number of test cases you need to solve.

Then each test case starts with an integer n (4 ≤ n ≤ 100) — the number of rooms.

The sum of n across the test cases doesn't exceed 500.

Output

To print the answer for a test case, print a line containing "3", followed by n lines, each containing a binary string of length n. The j-th character of the i-th string should be 1 if there's a path from room i to room j, and 0 if there isn't. The i-th character of the i-th string should be 1 for each valid i.

After printing the answer, we will respond with a single integer. If it's 1, you printed a correct answer and should keep solving the test cases (or exit if it is the last one). If it's -1, you printed a wrong answer and should terminate to get Wrong answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream.

Interaction

To ask a question of the first type, use the format: 

  * 1 a b (0 ≤ a,b ≤ n-1, a ≠ b). 
  * we will answer with 1 if the passage is from a to b, and 0 if it is from b to a. 
  * you can ask at most 9n questions of this type in each test case. 



To ask a question of the second type, use the format: 

  * 2 x k s_1 s_2 ... s_k (0 ≤ x,s_i ≤ n-1, 0 ≤ k < n, x ≠ s_i, elements of s are pairwise distinct). 
  * we will answer with 1 if there's a passage from x to any of the rooms in s, and 0 otherwise. 
  * you can ask at most 2n questions of this type in each test case. 



If we answer with -1 instead of a valid answer, that means you exceeded the number of queries or made an invalid query. Exit immediately after receiving -1 and you will see Wrong answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream.

After printing a query, do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see the documentation for other languages.



Hacks:

The first line should contain an integer t — the number of test cases.

The first line of each test case should contain an integer n (4 ≤ n ≤ 100) — the number of rooms.

Each of the next n lines should contain a binary string of length n. The j-th character of the i-th string should be 1 if there's a passage from room i to room j, 0 otherwise. The i-th character of the i-th string should be 0.

Example

Input


1
4

0

0

1

1

1

Output


2 3 3 0 1 2

1 0 1

1 0 2

2 2 1 1

3
1111
1111
1111
0001

Note

In the given example:

<image>

The first query asks whether there's a passage from room 3 to any of the other rooms.

The second query asks about the direction of the passage between rooms 0 and 1.

After a couple other queries, we concluded that you can go from any room to any other room except if you start at room 3, and you can't get out of this room, so we printed the matrix:
    
    
      
    1111  
    1111  
    1111  
    0001  
    

The interactor answered with 1, telling us the answer is correct.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long double PI = acos(-1);
long double DEL = 1e-10;
int M =  1e9 + 7;
const int N = 3e5 + 10;

#define ftt cin>>tc;for(int cas=1;cas<=tc;++cas)
#define all(a) a.begin(),a.end()
#define vpii vector<pair<int,int>>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define vi vector<int>
#define sq(a) ((a)*(a))
#define double long double
#define dbg cout<<"\nhi\n";
#define int long long
#define nl cout<<endl
#define sp <<" "<<
#define S second
#define F first

template<class T> using minpq = priority_queue<T,vector<T>,greater<T>>;
struct DSU
{
    vi par,size;
    DSU (int n)
    {
        par.resize(n+1);
        size.resize(n+1);
        for(int i=0;i<=n;i++)
        {
            par[i] = i;
            size[i] = 1;
        }
    }
    
    int find(int x)
    {
        return par[x] = (x == par[x]? par[x]:find(par[x]));
        
    }
    
    void join(int x,int y)
    {
        int parx = find(x),pary = find(y);
        if(parx == pary)
        {
            return;
        }
        if(size[parx] > size[pary])
        {
            size[parx] += size[pary];
            par[pary] = parx;
        }
        else
        {
            size[pary] += size[parx];
            par[parx] = pary;
        }
    }
};
int fpow(int x, int n)
{
    int res = 1;
    x %= M;
    while(n)
    {
        if(n&1)res = res * x % M;
        x = x * x % M;
        n>>=1;
    }
    return res;
}
int gcd(int a,int b)
{
    if(b == 0)return a;
    return gcd(b,a % b);
}
int lcm(int a,int b)
{
    return a*(b/gcd(a,b));
}
int popcount(int x)
{
    return bitset<65>(x).count();
}
void create_fac(int n)
{
    vector<int> fac(N),inv(N);
    fac[0] = inv[0] = 1;
    for(int i=1;i<=n;i++)
    {
        fac[i] = fac[i-1]*i % M;
        inv[i] = fpow(fac[i],M-2);
    }
}
int ncr(int n,int r)
{
    vector<int> fac(N),inv(N);
    return fac[n] * (inv[r] * inv[n-r] % M) % M;
    return fac[n] * (fpow(fac[r],M-2) * fpow(fac[n-r],M-2) % M ) % M;
}
void sieve (int n)      // linear sieve
{
    vector <int> primes;
    bool iscomp[N];
    for (int i = 2; i <= n; ++i)
    {
        if (!iscomp[i]) primes.push_back(i);
        for (int j = 0; j < primes.size() && i * primes[j] <= n; ++j)
        {
            iscomp[i * primes[j]] = true;
            if (i % primes[j] == 0) break;
        }
    }
}

//**************************************** CHECK CONSTRAINTS ***************************************
int cnt, sum, mid, mx, mn, ans[N], a[N], b[N];
int n, m, d, i, j, k, l, p[N], q, r, t, w, x, y, z, tc;
string s;

bool ch(int a,int b){
    cout<<1 sp a sp b;nl;
    int ans;
    cin>>ans;
    if(ans == -1)exit(0);
    return ans == 1;
}

void build(int l,int r){
    if(l == r){
        return;
    }
    int mid = (l+r)/2;
    build(l,mid);
    build(mid+1,r);
    
    int i = l;
    int j = mid + 1;
    
    vi v;
    while(i <= mid and j <= r){
        if(ch(a[i],a[j])){
            v.push_back(a[i]);
            i++;
        }
        else{
            v.push_back(a[j]);
            j++;
        }
    }
    while(i <= mid){
        v.push_back(a[i]);
        i++;
    }
    while(j <= r){
        v.push_back(a[j]);
        j++;
    }
    
    int k = l;
    for(auto j:v){
        a[k] = j;
        k++;
    }
    
}

bool query(int i,int l){
    cout<<2 sp i sp l + 1;
    for(int j = 0;j <= l;j++){
        cout<<" "<<a[j];
    }
    nl;
    int ans;
    cin>>ans;
    if(ans == -1)exit(0);

    return ans;
}


int32_t main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//    #ifndef ONLINE_JUDGE
//    freopen("/Users/jenish/XCode/CP/input.txt","r",stdin);
//    #endif
    
    ftt{
        cin>>n;
        
        for(int i = 0;i < n; i++){
            a[i] = i;
        }
        
        //a[1]...a[n] represents hamiltonian path
        //build(0,n - 1);
        stable_sort(a,a+n,ch);
        
        //for(int i = 1;i<=n;i++)cout<<a[i]<<" ";nl;
        p[n] = n;
        cnt = 0;
        vvi ans(n,vi(n,1));

        for(int i = n - 1;i >= 0;--i){
            p[i] = min(i - 1,p[i+1] - 1);
            
            while(p[i] >= 0 and query(a[i],p[i])){
                p[i]--;
            }
            
            p[i]++;
            
            for(int j = p[i];j < i;j++){
                p[j] = p[i];
            }
            
            if(p[i] == i)
                for(int j = p[i];j<n;j++){
                    for(int k = 0;k < p[i];k++){
                        ans[a[j]][a[k]] = 0;
                    }
                }
        }
        
        cout<<3;nl;
        for(int i = 0;i < n;++i){
            for(int j = 0;j < n;++j){
                cout<<ans[i][j];
            }
            nl;
        }
        cin>>x;
        if(x == -1){
            return 0;
        }
    }
    
}