#include <stdio.h>
#include <vector>
using namespace std;

int N, K;

vector<int> make(int n, int v)
{
	vector<int> ret;
	int s = 0, e = n - 1;
	for (int i = 0; i < n; i++){
		if (v >= e - s){
			v -= e - s;
			ret.push_back(e);
			e--;
		}
		else{
			ret.push_back(s);
			s++;
		}
	}
	return ret;
}

int A[1010][1010];

int main()
{
	scanf ("%d %d", &N, &K);
	int L = N * (N - 1) * N;

	if (K > N){
		puts("No");
		return 0;
	}

	bool m = 0;
	if (K >= L / 2){
		K -= L / 2;
		m = 1;
	}

	for (int i = 0; i < N; i++){
		int p = m ? (N - i) * 10000 : (i + 1) * 10000;
		if (K >= N * (N - 1) / 2){
			K -= N * (N - 1) / 2;
			for (int j = 0; j < N; j++){
				A[i][j] = p + N - j;
			}
		}
		else if (K == 0){
			for (int j = 0; j < N; j++){
				A[i][j] = p + j;
			}
		}
		else{
			auto v = make(N, K);
			for (int j = 0; j < N; j++){
				A[i][j] = p + v[j];
			}
		}
	}

	puts("Yes");
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++) printf ("%d%c", A[i][j], j + 1 < N ? ' ' : '\n');
	}
	return 0;
}