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

typedef long long ll;

// #define tpyeinput int
// inline char nc() {static char buf[1000000],*p1=buf,*p2=buf;return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;}
// inline void read(tpyeinput &sum) {char ch=nc();sum=0;while(!(ch>='0'&&ch<='9')) ch=nc();while(ch>='0'&&ch<='9') sum=(sum<<3)+(sum<<1)+(ch-48),ch=nc();}

template<typename T>
void read(T &x) {
    int f = 1;
    x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + (ch ^ 48);
        ch = getchar();
    }
    x *= f;
}

const int N = 1e2+10, M = 2*N;
int g[N][N], col[N][N];

void solve() {
    int n, k;
    read(n); read(k);
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            g[i][j] = col[i][j] = 0;
        }
    }
    if(k > n/2) {
        puts("NO");
        return;
    }
    for(int i = 1; i <= n/2; i++) {
        col[2*i-1][2*i] = i;
    }
    for(int i = 1; i <= n/2; i++) {
        for(int j = i+1; j <= n/2; j++) {
            col[2*i-1][2*j-1] = col[2*i][2*j] = i;
            col[2*j-1][2*i-1] = col[2*j][2*i] = i;
            col[2*i-1][2*j] = col[2*i][2*j-1] = j;
            col[2*j][2*i-1] = col[2*j-1][2*i] = j;
        }
    }
    if(n&1) {
        for(int i = 1; i <= n-1; i++) {
            col[i][n] = col[n][i] = (i+1)/2;
        }
    }
    puts("YES");
    for(int i = 1; i < n; i++) {
        for(int j = 1; j <= i; j++) {
            printf("%d ", col[j][i+1]);
        }
        puts("");
    }
}

int main() {
#ifdef LOCAL_TEST
    freopen("test.in", "r", stdin);
#endif
    int times = 1;
    read(times);
    while(times--) {
        solve();   
    }
    return 0;
}