#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N, K;
	cin >> N >> K;
	int p = N / K;
	if (p % 2 == 0) {
		cout << "Yes" << endl;
		for (int i = 0; i < K * (p / 2); i += p / 2) {
			for (int j = 0; j < p / 2; ++j) {
				if (j) cout << ' ';
				cout << i + j + 1;
			}
			for (int j = 0; j < p / 2; ++j) {
				cout << ' ' << N - i - j;
			}
			cout << endl;
		}
	}
	else if (K == 1) {
		cout << "Yes" << endl;
		for (int i = 0; i < N; ++i) {
			if (i) cout << ' ';
			cout << i + 1;
		}
		cout << endl;
	}
	else if (p == 1) {
		cout << "No" << endl;
	}
	else if (N % 2 == 0) {
		cout << "No" << endl;
	}
	else {
		vector<vector<int> > g(p);
		int lim = K * 3 / 2;
		for (int i = -lim; i <= lim; ++i) {
			if ((i > 0 ? i : -i) % 3 == 0) {
				g[0].push_back(i + N / 2);
			}
			else if (i < 0) {
				g[1].push_back(i + N / 2);
			}
			else {
				g[2].push_back(i + N / 2);
			}
		}
		reverse(g[0].begin(), g[0].end());
		int t = (p - 3) / 2;
		for (int i = 0; i < t * K; ++i) {
			g[3 + i % t * 2].push_back(i);
			g[4 + i % t * 2].push_back(N - i - 1);
		}
		cout << "Yes" << endl;
		for (int i = 0; i < K; ++i) {
			for (int j = 0; j < p; ++j) {
				if (j) cout << ' ';
				cout << g[j][i] + 1;
			}
			cout << endl;
		}
	}
	return 0;
}