#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,p,q,k,a[1002][1002];
bool w[1000002];
int main()
{
    freopen("tablete.in","r",stdin);
    freopen("tablete.out","w",stdout);
    scanf("%d %d",&n,&k);
    if (k%2==0)
    {
        for (i=1;i<=n;i++) {for (j=1;j<=n;j++) printf("%d ",(i-1)*n+j); printf("\n");}
    }
    else
    {
        if (n%2==0)
        {
            for (j=1;j<k;j++) a[1][j]=j;
            for (i=2;i<=n;i++) for (j=2;j<k;j++) a[i][j]=a[i-1][j]+k;
            for (i=1;i<=n;i++)
            a[i][k]=a[i-1][k]+k+(i%2),a[i][1]=k*(i-1)+(i%2);
            for (i=1;i<=n;i++) for (j=k;j<=n;j++) a[i][j]=a[i][j-1]+2;
        }
        if (n%2==1)
        {
            for (i=1;i<=n;i++) for (j=1;j<=k;j++) a[i][j]=k*(i-1)+j;
            for (i=1;i<=n;i++) {a[i][k]=k*(i-1); if (i%2==1) a[i][k]++; }
            for (i=1;i<=n;i++) for (j=k;j<=n;j++) a[i][j]=k*(i-1)+j;
        }
        for (i=1;i<=n;i++) {for (j=1;j<=n;j++) printf("%d ",a[i][j]); printf("\n");}
    }
    return 0;

}