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

using ll = long long;

ll n, k, a[1010][1010];
set<ll> ve;

void dfs(int ceng, int l, int r, int len){
    if(len == 2){
        assert(ceng == 1);
        a[ceng][l] = r;
        a[ceng][r] = l;
        return ;
    }
    int left = *prev(ve.lower_bound(len));
    dfs(left - 1, l, l + left - 1, left);
    dfs(len - left - 1, l + left, r, len - left);
    
    if(left * 2 != len) return;

    for(int i = left; i <= ceng; i++){
        int p = l, q = left + l + i - left;
        a[i][p] = q; a[i][q] = p;
        for(int j = 1; j < left; j++){
            int pp = a[j][p], qq = a[j][q];
            a[i][pp] = qq;
            a[i][qq] = pp;
        }
    }
}

void solve(){
    cin >> n >> k;
    ll limit = 0;
    if(ve.count(n)){
        limit = n;
    }else{
        limit = n & (-n);
    }

    if(k > limit - 1 || n % 2 == 1){
        cout << "Impossible\n";
        return;
    }

    dfs(k, 1, n, n);

    for(int i = 1; i <= k; i++){
        for(int j = 1; j <= n; j++){
            cout << a[i][j] << " ";
        }
        cout << '\n';
    }
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    for(ll i = 1; i < 1e9; i <<= 1){
        ve.insert(i);
    }

    int t = 1;
    cin >> t;
    
    while(t--){
        solve();
    }

    return 0;
}