#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
  int n,k;
  cin >> n >> k;
  if (n%2 == 1) {
    cout << "Impossible" << "\n";
    return;
  }
  if ((n & (n-1)) != 0) {
    cout << "Impossible" << "\n";
    return;
  }
  if (k >= n) {
    cout << "Impossible" << "\n";
    return;
  }
  vector g(n, set<int>());
  for (int i=0;i<n;i++){
    for(int j=0;j<n;j++) {
      if (i == j) continue;
      g[i].insert(j);
    }
  }
  vector<vector<int>> ans;
  for (int i=0;i<k;i++){
    ans.push_back(vector<int>(n));
    vector<int> vis(n);
    for (int j=0;j<n;j++){
      if (vis[j]) continue;
      int u = j;
      for (auto it = g[u].begin(); it != g[u].end(); ++it) {
        int v = *it;
        if (!vis[v]) {
          vis[u] = true;
          vis[v] = true;
          g[u].erase(v);
          g[v].erase(u);
          ans.back()[v] = u;
          ans.back()[u] = v;
          break;
        }
      }
      
    }
  }
  for (int i=0;i<k;i++) {
    for (int j=0;j<n;j++) {
      if (j != n-1) {
        cout << ans[i][j] + 1 << " ";
      } else {
        cout << ans[i][j] + 1;
      }
    }
    cout << "\n";
  }
  
}

int main() {
  int t;
  cin >> t;
  while (t--)
    solve();
}