//
// Stvoreno mustangom288 o 22.07.2023 11:37:10
//

#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define PB push_back

#define all(a) a.begin(), a.end()
#define len(a) (int) (a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

#ifdef Energy_is_not_over
#define DEBUG for (bool ____DEBUG = true; ____DEBUG; ____DEBUG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = 1011, inf = 1000111222;
int n, k;
int ans[max_n][max_n];

void solve() {
    int maxp2 = 1;
    while((n % (maxp2 * 2) == 0)) {
        maxp2 *= 2;
    }
    if (k >= maxp2) {
        cout << "Impossible" << "\n";
        return;
    }
    int step = 2;
    for (int it = 1; it <= k; ++it) {
        if (it == step) {
            step *= 2;
        }
        if (it == 1) {
            for (int i = 0; i < n; ++i) {
                ans[it][i] = i ^ 1;
            }
        } else {
            ans[it][0] = it;
            ans[it][it] = 0;
            for (int i = 1; i < step / 2; ++i) {
                int to = ans[i][it];
                ans[it][to] = i;
                ans[it][i] = to;
            }
            for (int k = step; k < n; k += step) {
                for (int j = 0; j < step; ++j) {
                    ans[it][k + j] = k + ans[it][j];
                }
            }
        }
        for (int i = 0; i < n; ++i) {
            cout << ans[it][i] + 1;
            if (i + 1 == n) {
                cout << "\n";
            } else {
                cout << ' ';
            }
        }
    }
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) {
        cin >> n >> k;
        solve();
    }

    return 0;
}