#include <bits/stdc++.h>

#define rep(i, l, r) for(int i = (int)l; i < (int)r; i++)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
using namespace std;

using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using ld = long double;

typedef vector<ll> vl;
typedef vector<int> vi;

template<class T>
void out(const vector<T> &v) {
    for (auto x: v)cout << x << " ";
    cout << endl;
}

const ll linf = 1e15 + 10;

void solve() {
    
    int n, k;cin >> n >> k;
    if (n % 2 == 1) {
        cout << "Impossible" << endl;
        return;
    }

    vector<vi> ans;

    rep(x, 1, n+1) {
        bool flag = true;
        vi a;
        rep(i, 0, n){
            if ((i ^ x) >= n) {
                flag = false;
                break;
            }
            a.emplace_back(i ^ x);
        }
        if (flag) ans.emplace_back(a);
    }
    if (sz(ans) >= k) {
        rep(t, 0, k){
            rep(i, 0, n) {
                if (i)cout << " ";
                cout << ans[t][i] + 1;
            }
            cout << endl;
        }
    }
    else {
        cout << "Impossible" << endl;
    }
}

int main() {


    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--) {
        solve();
    }
    
}