#include <bits/stdc++.h>

template <class T>
inline void read(T &res)
{
	char ch; bool flag = false; res = 0;
	while (ch = getchar(), !isdigit(ch) && ch != '-');
	ch == '-' ? flag = true : res = ch ^ 48;
	while (ch = getchar(), isdigit(ch))
		res = res * 10 + ch - 48;
	flag ? res = -res : 0; 
}

template <class T>
inline void put(T x)
{
	if (x > 9)
		put(x / 10);
	putchar(x % 10 + 48);
}

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}

const int N = 1005;
int a[N][N];
int T_data, n, k;

inline void solve(int n)
{
	if (n == 2)
	{
		a[1][1] = 2;
		a[1][2] = 1;
		return ;
	}
	solve(n >> 1);
	for (int i = 1; i < (n >> 1); ++i)
		for (int j = (n >> 1) + 1; j <= n; ++j)
			a[i][j] = a[i][j - (n >> 1)] + (n >> 1);
	for (int i = n >> 1; i < n; ++i)
	{
		a[i][1] = i + 1;
		a[i][i + 1] = 1;
		for (int j = 1; j < (n >> 1); ++j)
		{
			a[i][a[j][1]] = a[j][i + 1];
			a[i][a[j][i + 1]] = a[j][1];		
		}
	}
}

int main()
{
	read(T_data);
	while (T_data--)
	{
		read(n); read(k);
		int x = 1, tmp = n;
		while (n % 2 == 0)
			n >>= 1, x <<= 1;
		n = tmp;
		if (k > x - 1)
			puts("Impossible");
		else 
		{
			solve(x);
			for (int i = 1; i <= k; ++i)
				for (int j = x + 1; j <= n; j += x) 
					for (int k = j; k <= j + x - 1; ++k)
						a[i][k] = a[i][k - x] + x;
			for (int i = 1; i <= k; ++i, putchar('\n'))
				for (int j = 1; j <= n; ++j)
				{
					put(a[i][j]);
					if (j < n)
						putchar(' ');
				}
		}
	}	
}