F. Tournament
思路:通过模拟我们,我们可以自己手写一些,以下图展示n=8时的匹配
我们能够发现图中的规律 ,其实就是左上角的一块填到右下角的一块,右上角的一块,填到左下角的一块,然后我们能够发现,他填的过程是一个树形结构,所以只有在每次除以二之后是2的倍数之后才能够继续填,而假如说n中有2^x则,最多只能够填x次匹配,能够匹配出2^x次,但是因为第一次是给定的,所以去掉一次,最多只能够进行2^x-1次
// Problem: F. Tournament
// Contest: Codeforces - The 2018 ICPC Asia Qingdao Regional Programming Contest (The 1st Universal Cup, Stage 9: Qingdao)
// URL: https://codeforces.com/gym/104270/problem/F
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector>
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
int T,hackT;
int n,m,k;
int ans[1010][1010];
void change(int len) {
for(int i=1;i<=n;i+=len) {
for(int k=1;k<=len/2;k++) {
for(int l=i;l<=i+len/2-1;l++) {
ans[k+len/2][l+len/2]=ans[k][l];
}
for(int l=i+len/2;l<=i+len-1;l++) {
ans[k+len/2][l-len/2]=ans[k][l];
}
}
}
}
int get(int x) {
int res=1;
while(x%2==0) x/=2,res*=2;
return res;
}
void solve() {
n=read(),k=read();
int s=get(n);
if(k>=s) printf("Impossible\n");
else {
for(int i=1;i<=n;i++) ans[1][i]=i;
for(int i=2;i<=s;i=i*2) change(i);
for(int j=2;j<=k+1;j++) {
for(int i=1;i<=n;i++) {
printf("%d%c",ans[j][i],i==n?'\n':' ');
}
}
}
}
int main() {
// init();
// stin();
scanf("%d",&T);
// T=1;
while(T--) hackT++,solve();
return 0;
}