#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
const int N = 1024 + 5;
int n, k, a[N][N], pos[N];
int b[5][5];

void fz(int x, int y, int len) {
    for (int i = 1; i <= x; i++)
        for (int j = 1; j <= y; j++) {

        }
}

int lowbit(int x) { return x & -x; }

int cal(int x) {
    if (x % 2 == 0)return x - 1;
    else return x + 1;
}
//int cal(int x) {
//    int ret = 0;
//    if ((1 << __lg(x)) == x)ret = __lg(x);
//    else ret = __lg(x);
//    return ret;
//}

void init() {
    for (int i = 1; i <= 1024; i++)
        a[0][i] = i;
    for (int i = 1; i <= 1023; i++) {
        for (int j = 1; j <= 1024; j += 2 * lowbit(i)) {
            for (int k = j; k <= j + lowbit(i) - 1; k++)
                a[i][k] = a[i - 1][k + lowbit(i)], a[i][k + lowbit(i)] = a[i - 1][k];
            // a[i][cal(k)] = a[i - 1][cal(k + lowbit(i))], a[i][cal(k + lowbit(i))] = a[i - 1][cal(k)];
        }
    }
    for (int i = 1; i <= 1024; i++)pos[a[i][1]] = i;
}

void solve() {
    cin >> n >> k;
    if (k <= lowbit(n) - 1) {
        for (int i = 1; i <= k; i++) {
            for (int j = 1; j <= n; j++) {
                cout << a[pos[i+1]][j];
                if (j < n)cout << ' ';
            }
            if (i <= k)cout << endl;
        }
    } else {
        cout << "Impossible\n";
    };
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    init();
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}