#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=110;

int adj[maxn][maxn];

void build(int n){

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)adj[i][j]=0;

    if(n%2==0){

        for(int i=1;i<=n/2;i++){

            int nd=n/2+i;

            adj[i][nd]=i;
            adj[nd][i]=i;

            for(int j=1;j<=n/2;j++){
                adj[i][n/2+j]=i;
                adj[n/2+j][i]=i;

                adj[nd][j]=i;
                adj[j][nd]=i;
            }

        }

    }
    else{
        n--;
        for(int i=1;i<=n/2;i++){

            int nd=n/2+i;

            adj[i][nd]=i;
            adj[nd][i]=i;

            adj[i][n+1]=i;
            adj[n+1][i]=i;
            adj[nd][n+1]=i;
            adj[n+1][nd]=i;

            for(int j=1;j<=n/2;j++){
                adj[i][n/2+j]=i;
                adj[n/2+j][i]=i;

                adj[nd][j]=i;
                adj[j][nd]=i;
            }

        }

    }

}

int main(){


    ///freopen("test.txt","r",stdin);

    int t;
    scanf("%d",&t);
    int pt=0;
    while(t--){

        pt++;

        int n,k;
        scanf("%d %d",&n,&k);

        if(pt==52){
            printf("%d %d TC\n",n,k);
            continue;
        }


        build(n);
        continue;
        if(k>n/2){
            printf("NO\n");
            continue;
        }
        printf("YES\n");
        for(int i=2;i<=n;i++){
            for(int j=1;j<i;j++){
                printf("%d ",max(1,min(k,adj[i][j])) );
            }
            printf("\n");
        }

    }


    return 0;
}