#include<cstdio>
#include<algorithm>
using namespace std;
FILE *in=fopen("tablete.in","r");
FILE *out=fopen("tablete.out","w");
int n,k,a[1005][1005];
int main(){
    fscanf(in,"%d%d",&n,&k);
    if(n%2==0){
        for(int i=1,t=1;i<=n;i++)
            for(int j=1;j<=n;j++,t++)
                a[j][i]=t;
        for(int i=1;i<=n-1;i+=2)
            swap(a[i][k],a[i+1][k-1]);
    }
    else{
        int t=1;
        for(int i=1;i<n;i++)
            for(int j=1;j<n;j++,t++)
                a[j][i]=t;
        for(int i=1;i<n-1;i+=2)
            swap(a[i][k],a[i+1][k-1]);
        if(k%2==0){
            for(int i=1;i<=n;i++,t++)
                a[n][i]=t;
            for(int i=1;i<n;i++,t++)
                a[i][n]=t;
        }
        else{
            ++t;
            for(int i=1;i<=n;i++,t++)
                a[n][i]=t;
            for(int i=1;i<n-1;i++,t++)
                a[i][n]=t;
            a[n-1][n]=(n-1)*(n-1)+1;
        }
    }
    for(int i=1;i<=n;i++,fprintf(out,"\n"))
        for(int j=1;j<=n;j++,fprintf(out," "))
            fprintf(out,"%d",a[i][j]);
}