#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    int n, k;
    std::cin >> n >> k;
    int m = n / k;

    std::vector<std::vector<int>> ans(k);

    auto turn = [&]() {
        for (int i = 0; i < k; ++i) {
            ans[i].push_back(n--);
        }
        for (int i = k - 1; i >= 0; --i) {
            ans[i].push_back(n--);
        }
        m -= 2;
    };

    if (m % 2 == 0) {
        while (n > 0) turn();

    } else if (k % 2 == 0) {
        std::cout << "No\n";
        return;

    } else if (m == 1) {
        if (k > 1) {
            std::cout << "No\n";
            return;
        }
        ans[0].push_back(1);

    } else {
        while (m > 3) turn();

        int d = k / 2;
        for (int i = 0; i < k; ++i) {
            ans[i].push_back(n--);
        }
        for (int i = 0; i < k; ++i) {
            ans[(d + i) % k].push_back(n--);
        }
        for (int i = 0; i < k; ++i) {
            ans[(d + i) * 2 % k].push_back(n--);
        }
    }

    std::cout << "Yes\n";
    for (const auto& v : ans) {
        for (auto x : v) std::cout << x << " ";
        std::cout << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}