#include <bits/stdc++.h>
using namespace std;
#define M 1005
using pii = pair<int,int>;
vector<pii> A[M];
int n,K,m;
void solve(){
    m = 0;
    int t = 0,p = n;
    while(p+1&1){
        if(m==0){
            for(int i=1;i<=n;i+=2)
                A[m].push_back(pii(i,i+1));
            m++;
            t = 1;
            p>>=1;
        }else{
            int lastm = m;
            for(int k=0;k<lastm;k++){
                for(int i=0;i<A[k].size();i+=t+t){
                    for(int j=0;j<t;j++){
                        auto [x,y] = A[k][i+j];
                        auto [a,b] = A[k][i+j+t];
                        A[m].push_back(pii(x,a));
                        A[m].push_back(pii(y,b));

                        A[m+1].push_back(pii(x,b));
                        A[m+1].push_back(pii(y,a));
                    }
                }
                m+=2;
            }
            p>>=1;
        }
    }
    if(m<K)puts("Impossible");
    else{
        for(int i=0;i<K;i++){
            static int pos[M];
            for(auto [x,y]:A[i])pos[x] = y,pos[y] = x;
            for(int j=1;j<=n;j++){
                printf("%d",pos[j]);
                if(j<n)putchar(' ');
            }
            if(i<K-1)puts("");
        }
    }
    for(int i=0;i<m;i++)A[i].clear();
}
int main(){
    int Cas;cin>>Cas;
    while(Cas--){
        scanf("%d%d",&n,&K);
        solve();
    }
    return 0;
}