#pragma comment(linker, "/STACK:16777216")
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <unordered_set>
#include <cstring>
#include <unordered_map>
#include "math.h"
#include <stdio.h>
#include <bitset>
#include <string>
#include <complex>
#include <iomanip>
#include <stack>
#include <deque>
#include <string>
#include<assert.h>
typedef long long ll;

using namespace std;
const ll MOD = 998244353;
const ll MAXN = 100005;
const double pi = acos(-1);

int a[2050][2050];

void rec(int sz) {
    if (sz == 0)
        return;
    rec(sz / 2);
    if (sz == 1) {
        a[0][0] = 1;
    }
    for (int i = sz / 2; i < sz; i++) {
        for (int j = sz / 2; j < sz; j++) {
            a[i][j] = a[i - sz / 2][j - sz / 2];
        }
    }
    for (int i = 0; i < sz / 2; i++) {
        for (int j = sz / 2; j < sz; j++) {
            a[i][j] = a[i][j - sz / 2] + sz / 2;
        }
    }
    for (int i = sz / 2; i < sz; i++) {
        for (int j = 0; j < sz / 2; j++) {
            a[i][j] = a[i - sz / 2][j] + sz / 2;
        }
    }
}


void solve() {
    int t;
    cin >> t;
    while(t--) {
        int n, k;
        cin >> n >> k;
        int maxi = 1;
        while (n % (maxi * 2) == 0) {
            maxi *= 2;
        }

        if (k > maxi - 1) {
            cout << "Impossible" << endl;
            continue;
        }

        rec(maxi);


        for (int i = 0; i < maxi; i++) {
            for (int j = maxi; j < n; j++) {
                a[i][j] = a[i][j - maxi] + maxi;
            }
        }

        for (int i = 1; i <= k; i++) {
            for (int j = 0; j < n; j++) {
                if (j != 0)
                    cout << " ";
                cout << a[i][j];
            }
            cout << endl;
        }
    }
}


int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    cout.precision(20);
    //precalc();
    //freopen("../in.txt", "r", stdin);
    //freopen("../out.txt", "w", stdout);
    solve();
    return 0;
}