/* name: 6643
 * author: 5ab
 * created at: 2023-07-03
 */
#include <iostream>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

using ll = long long;
const int max_n = 100;

int g[max_n][max_n];

void conn(int x, int y, int c) { g[x][y] = g[y][x] = c; }

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int cas, n, k;
	
	cin >> cas;
	while (cas--)
	{
		cin >> n >> k;
		if (k > n / 2)
		{
			cout << "NO\n";
			continue;
		}
		
		cout << "YES\n";
		for (int i = 0; i < k; i++)
		{
			int x = i * 2, y = i * 2 + 1;
			conn(x, y, i + 1);
			for (int j = 0; j < k; j++)
				if (j < i)
				{
					conn(x, j * 2 + 1, i + 1);
					conn(y, j * 2, i + 1);
				}
				else if (j > i)
				{
					
					conn(x, j * 2, i + 1);
					conn(y, j * 2 + 1, i + 1);
				}
		}
		for (int i = k * 2; i < n; i++)
			for (int j = 0; j < i; j++)
				conn(i, j, 1);
		
		for (int i = 1; i < n; i++)
			for (int j = 0; j < i; j++)
				cout << g[i][j] << " \n"[j == i - 1];
	}
	
	return 0;
}
// started coding at: 07-03 08:52:02