#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
using ll = long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 2e5 + 5;
const int MOD = 1e9+7; //998244353;
const int INF = 0x3f3f3f3f;
const ll INF64 = ll(4e18) + 5;

void solve(){
	int n,k;
	cin >> n >> k;
	if( k > n/2){
		cout << "NO\n";
		return;
	}
	vector<vector<int>> colors(n, vector<int>(n));
	auto uni = [&](int a, int b, int c, int d, int cor1, int cor2){
		colors[a][c] = cor2;
		colors[a][d] = cor1;
		colors[b][c] = cor1;
		colors[b][d] = cor2;
	};

	for(int cor1 = 0; cor1 < k; cor1++){
		colors[2*cor1][2*cor1+1] = cor1;
		for(int cor2 = cor1+1; cor2 < k; cor2++){
			uni(2*cor1,2*cor1+1,2*cor2,2*cor2+1,cor1,cor2);
		}
	}
	for(int livre = 2*k; livre < n; livre++){
		for(int cor = 0; cor < k; cor++){
			colors[2*cor][livre] = cor;
			colors[2*cor+1][livre] = cor;
		}
	}
	cout << "YES\n";
	for(int i = 1; i < n; i++){
		for(int j = 0; j < i; j++){
			cout << colors[j][i]+1 << ' ';
		}
		cout << '\n';
	}
}

signed main(){

    ios::sync_with_stdio(false); cin.tie(NULL);

    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

/*
Makefile:
CXXFLAGS=-Wall -Wextra -Wshadow -g -pedantic -fsanitize=address,undefined -D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUGPEDANTIC -std=gnu++17
*/