#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 1 << 18;

std::pair<int, int> mx[N];

void pull(int p) {
    mx[p] = std::max(mx[2 * p], mx[2 * p + 1]);
}

void modify(int p, int l, int r, int x, int v) {
    if (r - l == 1) {
        mx[p] = {v, x};
        return;
    }
    int m = (l + r) / 2;
    if (x < m) {
        modify(2 * p, l, m, x, v);
    } else {
        modify(2 * p + 1, m, r, x, v);
    }
    pull(p);
}

std::pair<int, int> query(int p, int l, int r, int x, int y) {
    if (l >= y || r <= x) {
        return {-1, -1};
    }
    if (l >= x && r <= y) {
        return mx[p];
    }
    int m = (l + r) / 2;
    return std::max(query(2 * p, l, m, x, y), query(2 * p + 1, m, r, x, y));
}

void solve() {
    int N, K;
    std::cin >> N >> K;
    
    if (K > N / 2) {
        std::cout << "NO\n";
        return;
    }
    
    std::cout << "YES\n";
    
    std::vector col(N, std::vector<int>(N, K));
    int m = N / 2;
    for (int i = 0; i < K - 1; i++) {
        col[i][i + m] = col[i + m][i] = i + 1;
        for (int j = 1; j < m; j++) {
            col[i][(i + j) % (2 * m)] = col[(i + j) % (2 * m)][i] = i + 1;
            col[i + m][(i + m + j) % (2 * m)] = col[(i + m + j) % (2 * m)][i + m] = i + 1;
        }
    }
    for (int i = 1; i < N; i++) {
        for (int j = 0; j < i; j++) {
            std::cout << col[i][j] << " \n"[j == i - 1];
        }
    }
}

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