using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cstdlib>
#include <utility>
#include <algorithm>
#include <functional>

#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define C(v) memset((v),0,sizeof((v)))
#define CP(x,y) memcpy((x),(y),sizeof((y)))
#define FORit(it,v) for(it = (v).begin();it != (v).end();++it)
#define mp make_pair

#define IN  "tablete.in"
#define OUT "tablete.out"
#define N_MAX (1<<10)

int A[N_MAX][N_MAX];
vector<bool> B(N_MAX*N_MAX);
int N,K;

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d%d",&N,&K);
}

//K e in stanga
II void solve1()
{
	int nextk(2);
	int nexta(1);
	
	FOR(i,1,N)
	FOR(j,1,K)
		if(j==K)
		{
			for(;B[nextk] || nextk < nexta;nextk += 2);
				A[i][j] = nextk;
			B[nextk] = true;
			nextk += 2;
		}	
		else
		{
			for(;B[nexta];++nexta);
			A[i][j] = nexta;
			B[nexta] = true;
			++nexta;
		}
	nexta = 1;	
	FOR(i,1,N)
	FOR(j,K+1,N)
	{
		for(;B[nexta];++nexta);
		B[nexta] = true;
		A[i][j] = nexta;
		++nexta;
	}	
	FOR(i,1,N)
	{
		FOR(j,1,N)
			printf("%d ",A[i][j]);
		printf("\n");
	}	
}

int main()
{
	scan();
	solve1();
	return 0;
}