#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 105;
const ll INF = 1ll << 60, mod = 1e9 + 7;

int n, k, t;
int f[N][N];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> t;
    while (t--)
    {
        cin >> n >> k;
        int m = n / 2;
        if (k > m)
        {
            puts("NO");
            continue;
        }
        for (int i = 1; i <= m; i++)
        {
            f[i * 2 - 1][i * 2] = i;
        }
        for (int i = 1; i <= m; i++)
        {
            for (int j = i + 1; j <= m; j++)
            {
                f[i * 2 - 1][j * 2 - 1] = i;
                f[i * 2][j * 2] = i;
                f[i * 2 - 1][j * 2] = j;
                f[i * 2][j * 2 - 1] = j;
            }
        }
        if (n & 1)
        {
            for (int i = 1; i <= n - 1; i++)
                f[i][n] = (i + 1) / 2;
        }
        puts("YES");
        for (int i = 2; i <= n; i++)
        {
            for (int j = 1; j < i; j++)
            {
                cout << min(f[j][i], k) << " \n"[j == i - 1];
            }
        }
    }

    return 0;
}