#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *fi,*fo;
int nr,n,i,j,k,A[1001][1001];
int main()
{
    fi=fopen("tablete.in","r");
    fo=fopen("tablete.out","w");
    fscanf(fi,"%d%d",&n,&k);
    nr=1;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<k; j++)
        {
            if(!A[i][j])
            {
                A[i][j]=nr;
                nr++;
            }
        }
        if(nr%2==0)
        {
            A[i][k]=nr;
            nr++;
        }
        else
        {
            A[i][k]=nr+1;
            if(i<n)
            {
                A[i+1][1]=nr;
            }
            else
                A[1][k+1]=nr;
            nr+=2;
        }
    }
    for(i=1; i<=n; i++)
    {
        for(j=k+1; j<=n; j++)
        {
            if(!A[i][j])
            {
                A[i][j]=nr;
                nr++;
            }
        }
    }
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            fprintf(fo,"%d ",A[i][j]);
        }
        fprintf(fo,"\n");
    }
    fclose(fi);
    fclose(fo);
    return 0;
}