//#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"

using namespace std;

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//{akane : ascending order, aoi : decending order} priority queue
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;

//------------------------------- Libraries ---------------------------------//

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    i64 n, k;
    cin >> n >> k;
    i64 l = n / k, x = n * (n + 1) / 2 / k;
    if (k * x * 2 != n * (n + 1))
    {
        cout << "No" << endl;
        return;
    }
    yukari<int> ans(k, akari<int>(l));
    if (l & 1)
    {
        if (l % k != 0)
        {
            cout << "No" << endl;
            return;
        }
        int cur = 1, s = 0;
        for (int i = 0; i < l; i++)
        {
            for (int j = 0; j < k; j++)
            {
                ans[(s + j) % k][i] = cur++;
            }
            s = (s + k - 1) % k;
        }
    }
    else
    {
        int cur = 1;
        for (int i = 0; i < l; i += 2)
        {
            for (int j = 0; j < k; j++)
            {
                ans[j][i] = cur++;
            }
            for (int j = k - 1; j >= 0; j--)
            {
                ans[j][i + 1] = cur++;
            }
        }
    }
    cout << "Yes\n";
    for (int i = 0; i < k; i++)
    {
        for (int j = 0; j < l; j++)
        {
            cout << ans[i][j] << ' ';
        }
        cout << '\n';
    }
}

int main()
{
    solve();
    return 0;
}