#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr long long INF = 1e18;

signed main(){
	int N,K;
	cin>>N>>K;
	int sum = N * (N + 1) / 2;
	if(N % K || sum % K){
		cout << "No" << endl;
		return 0;
	}
	vector<vector<int>>ans(K);
	REP(i,N/K){
		REP(j,K){
			ans[(j + i) % K].push_back(i * K + j);
		}
	}
	REP(i,K){
		if(sum / K != accumulate(ALL(ans[i]),0) + N / K){
			cout << "No" << endl;
			return 0;
		}
	}
	cout << "Yes" << endl;
	REP(i,K){
		REP(j,ans[i].size()){
			if(j)cout<<" ";
			cout << ans[i][j] + 1;
		}
		cout << endl;
	}
}