#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <random>
#include <cstdlib>
#include <numeric>
#include <functional>
#include <queue>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;

void slove()
{
	int n, k;
	cin >> n >> k;

    // 可行构造方案数为2的因数个数次方 - 1;

	int tmp = 0;
	int tk = k;
	while (tk % 2 == 0) {
		tmp++;
		tk /= 2;
	}

	if (n > (int)pow(2, tk) - 1) {
		cout << "Impossible\n";
		return;
	}

	vector<vector<int>> data(k + 1, vector<int>(n + 1));
	
	int up = 1;

	for (int i = 1; i <= k; i++) {
		data[i][1] = i + 1;
		if (i >= up) up *= 2;
		for (int j = 2; j <= up; j *= 2) {
			int rem = (data[i][1] - 1) % j;

			if (rem >= j / 2) rem = -(j / 2);
			else rem = j / 2;

			int h = j / 2;
			for (int m = j / 2 + 1; m <= j; m++) {
				data[i][m] = data[i][m - h] + rem;
			}
		}

		// 迭代到满
		for (int j = 2; j * up <= n; j++) {
			int diff = (j - 1) * up;
			for (int m = 1; m <= up; m++) {
				data[i][m + diff] = data[i][m] + diff;
			}
		}
	}
    
	for (int i = 1; i <= k; i++) {
		for (int j = 1; j <= n; j++) {
			cout << data[i][j] << " ";
		}
		cout << "\n";
	}
	return;
}

int main()
{
	//freopen("out.txt", "w", stdout);
	//freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false);

	cin.tie(0);
	cout.tie(0);

	int cnt = 1;
	cin >> cnt;

	while (cnt--)
	{
		slove();
	}
};