#include <cstdio>
#include <algorithm>

using namespace std;

int n,k,a[1005][1005],nr;

void umplere(int is,int js,int ij,int jj)
{
    for(int i=is;i<=ij;i++)
    {
        for(int j=js;j<=jj;j++)
        {
            a[i][j]=++nr;
        }
    }
}

int main()
{
    freopen("tablete.in","r",stdin);
    freopen("tablete.out","w",stdout);

    scanf("%d %d",&n,&k);
    umplere(1,1,n,k);
    umplere(1,k+1,n,n);

    if(a[1][k]%2 !=0)
        swap(a[1][k],a[n][1]);
    for(int i=2;i<n;i++)
    {
        if(a[i][k]%2 !=0)
        {
            swap(a[i][k],a[i-1][k+1]);
        }
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
    return 0;
}