// yuki 942 プレゼント配り
// 2019.12.8 bal4u

#include <stdio.h>
#include <stdlib.h>

typedef long long ll;

int getchar_unlocked(void);
int putchar_unlocked(int c);
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(int n) { // 非負整数の表示（出力）
	int i = 0; char b[30];
	while (n) b[i++] = n % 10 + '0', n /= 10;
	while (i--) pc(b[i]);
}

void outs(char *s) { while (*s) pc(*s++); pc('\n'); }
int *ans[200002];

int main()
{
	int i, j, k, N, K, a;
	
	N = in(), K = in();
	if (K == 1) {
		outs("Yes");
		a = 0; while (--N) out(++a), pc(' ');
		out(++a), pc('\n');
		return 0;
	}
	if (N == K) { outs("No"); return 0; }
	int s = N/K;
	for (i = 0; i < K; ++i) ans[i] = malloc(s*sizeof(int));
	if (s & 1) {
		if (K & 1) {
			a = 0, k = s-3;
			for (j = 0; j < k; ++j) {
				for (i = 0; i < K; ++i) ans[i][j] = ++a;
				if (++j >= k) break;
				for (i = K-1; i >= 0; --i) ans[i][j] = ++a;
			}
			ll x = 0; for (j = 0; j < k; ++j) x += ans[0][j];
			x = (ll)N*(N+1)/(2*K) - x;
			for (i = 0; i < K; ++i) ans[i][k] = ++a;
			j = s-2, k = K/2+1;
			for (i = 0; i < K; ++i) {
				if (k == K) k = 0;
				ans[k++][j] = ++a;
			}
			++j;
			for (i = 0; i < K; ++i) {
				ans[i][j] = (int)(x-(ans[i][j-2]+ans[i][j-1]));
			}
		} else { outs("No"); return 0; }
	} else {
		a = 0, j = 0;
		while (j < s) {
			for (i = 0; i < K; ++i) ans[i][j] = ++a;
			++j;
			for (i = K-1; i >= 0; --i) ans[i][j] = ++a;
			++j;
		}
	}

	outs("Yes");
	for (i = 0; i < K; ++i) {
		out(ans[i][0]);
		for (j = 1; j < s; ++j) pc(' '), out(ans[i][j]);
		pc('\n');
	}
	return 0;
}