#include <bits/stdc++.h>

using namespace std;

void solve() {
	int n, k;
	cin >> n >> k;
	if (n % 2 == 1 || n <= k) {
		cout << "Impossible\n";
		return;
	}
	vector<vector<int>> b;
	vector<int> a;
	for (int i = 0; i < n; i++) {
		int bat = i ^ 1;
		a.push_back(bat);
	}
	b.emplace_back(a);
	for (int c = 2; b.size() < k; c += 2) {
		a.resize(n);
		for (int i = 0; i < n; i++) a[i] = -1;
		for (int i = 0; i < n; i++) {
			int bat = (i + c) % n;
			a[i] = bat;
			if (a[bat] == -1)
				a[bat] = i;
		}
		b.push_back(a);
		for (int i = 0; i < n; i += 2)
			swap(a[i], a[i + 1]);
		b.emplace_back(a);
	}
	for (int i = 0; i < k; i++)
		for (int j = 0; j < n; j++)
			cout << b[i][j] + 1 << " \n"[j + 1 == n];
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	
	}
}