Contest1_Bai1

//
//  main.cpp
//  Contest
//
//  Created by Thế Anh on 2/16/19.
//  Copyright © 2019 Thế Anh. All rights reserved.
//

#include <iostream>
using namespace std;

int a[100005];

void first(int a[], int n){
    for(int i = 1; i <= n; i++){
        a[i] = 0;
    }
}

bool isLast(int a[], int n){
    for(int i = 1; i <= n; i++){
        if(a[i] == 0) return false;
    }
    return true;
}

void sinh(int a[], int n, int k){
    int pos = n;
    while(a[pos] == 1){
        pos --;
    }
    a[pos] = 1;
    for(int i = pos+1; i <= n; i++){
        a[i] = 0;
    }
}

void in(int a[], int n, int k){
    int number1 = 0;
    for(int i = 1; i <= n; i++){
        if(a[i] == 1){
            number1++;
        }
    }
    if(number1 == 2){
        for(int i = 1; i <= n; i++){
            cout << a[i];
        }
        cout << endl;
    }
}

int main(){
    int test;
    cin >> test;
    while(test-- >= 0){
        int n, k;
        cin >> n >> k;
        first(a, n);
        while(!isLast(a, n)){
            sinh(a, n, k);
            in(a, n, k);
        }


    }
    return 0;
}