#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin ("tabela.in");
ofstream cout ("tabela.out");
int lgput (long long a, long long exp, long long mod)
{
    long long rez=1;
    while(exp)
        if(exp&1)rez*=a,rez%=mod,--exp;
            else a*=a,a%=mod,exp>>=1;
    rez%=mod;
    return rez;
}
int m[1005][1005];
bool f[1000003];
int main()
{
    ios_base::sync_with_stdio(0);cin.tie();cout.tie();
    long long i,j,cnt0=0,rezt=0,n,spatiu=0,poz=-1,k,cur=1;
    cin>>n>>k;
    for(i=1;i<=n;++i)
    {
        for(j=1;j<k;++j){
            while(f[cur])
                ++cur;
            f[cur]=true,m[i][j]=cur++;}
        if(cur&1)
            m[i][j]=cur+1,f[cur+1]=true;
        else
            m[i][j]=cur,f[cur]=true,++cur;
    }
    for(i=1;i<=n;++i)
        for(j=k+1;j<=n;++j){
            while(f[cur])
                ++cur;
            f[cur]=true,m[i][j]=cur++;}
    for(i=1;i<=n;++i)
    {
        for(j=1;j<=n;++j)
            cout<<m[i][j]<<' ';
        cout<<'\n';
    }
}