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

const int N = 105;
int edg[N][N];

void solve() {
    int n, k; cin >> n >> k;
    if (k>n/2) {
        cout << "NO\n"; return ;
    }

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

    auto inv = [&](int a) {return n+1-a;};
    for (int c=1; c<=k; ++c) {
        edg[c][inv(c)] = c;
        for (int i=1; i<c; ++i) edg[c][inv(i)] = c, edg[i][inv(c)] = c;
        for (int i=c+1; i<=n/2; ++i) edg[c][i] = c, edg[inv(c)][inv(i)] = c;
    }
    
    if (n%2==1) {
        for (int i=1; i<=n/2; ++i) edg[i][(n+1)/2] = i, edg[(n+1)/2][inv(i)] = i;
    }

    cout << "YES\n";
    for (int i=2; i<=n; ++i) {
        for (int j=1; j<i; ++j) {
            if (edg[j][i]==0) edg[j][i] = 1;
            cout << edg[j][i] << ' ';
        }
        cout << '\n';
    }
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t; while (t--) solve();
    return 0;
}