#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  ll n, k;std::cin >> n >> k;
  ll S = (n*(n+1))/2;
  if(k==1){
    std::cout << "Yes" << '\n';
    rep(i, 1, n+1) std::cout << i << (i==n?"\n":" ");
    return 0;
  }
  if(S%k||n==k){
    std::cout << "No" << '\n';
    return 0;
  }
  std::cout << "Yes" << '\n';
  ll num = n/k;//一人あたり
  vvl ans = VV(k, num, 0, ll);
  if(num%2==0){
    for(int i=0;i<num;i++){
      vll ad;
      for(int j=0;j<k;j++) ad.push_back(i*k+j);
      if(i%2) reverse(all(ad));
      for(int j=0;j<k;j++) ans[j][i] = ad[j] + 1;
    }
  }else{
    vvl d = VV(k, 3, 0, ll);
    for(int i=0;i<k;i++){
      if(i<k/2){
        ll p = 2*k - 2 - 2 * i;
        d[i] = {i+1+p+1, i+1, p+1};
      }else{
        ll p = k + 2*(k-1-i);
        d[i] = {i+1+p+1, i+1, p+1};
      }
    }
    sort(all(d));
    reverse(all(d));
    for(int i=0;i<k;i++) {
      ans[i][0] = d[i][1], ans[i][1] = d[i][2];
      //std::cout << d[i][0] << " " << d[i][1] << " " << d[i][2] << '\n';
    }
    for(int i=2;i<num;i++){
      vll ad;
      for(int j=0;j<k;j++) ad.push_back(i*k+j);
      if(i%2) reverse(all(ad));
      for(int j=0;j<k;j++) ans[j][i] = ad[j] + 1;
    }
  }
  re(i, k) re(j, num) std::cout << ans[i][j] << (j==num-1?"\n":" ");
}