#include<fstream>
#define maxn 1005
#define end for(i=1;i<=n;++i){ for(j=1;j<n;++j) g<<a[i][j]<<" ";g<<a[i][n]<<"\n";} f.close();g.close();return 0;

using namespace std;

ifstream f("tablete.in");
ofstream g("tablete.out");

int a[maxn][maxn],i,j,n,k,p;

int main()
{
    f>>n>>k;
    if((n&1)&&(k&1))
    {
        ++p;
        for(i=1;i<n;++i)
            for(j=1;j<n;++j)
                a[i][j]=++p;

        a[n][1]=1;
        a[n][2]=++p;
        for(i=3;i<=n;++i)
            a[n][i]=a[n][i-1]+2;

        a[1][n]=++p;
        for(i=2;i<n;++i)
            a[i][n]=a[i-1][n]+2;

        end
    }

    if(n&1)
    {
        for(i=1;i<=n;++i)
            for(j=1;j<n;++j)
                a[i][j]=++p;

        for(i=1;i<=n;++i)
            a[i][n]=++p;

        end
    }

    if(k&1)
    {
        ++p;
        for(i=1;i<n;++i)
            a[1][i]=++p;
        a[1][n]=n*n;

        ++p;
        for(i=2;i<n;++i)
            for(j=1;j<=n;++j)
                a[i][j]=++p;

        a[n][1]=1;
        a[n][2]=n+1;
        for(i=3;i<=n;++i)
            a[n][i]=++p;

        end
    }

    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            a[i][j]=++p;

    end
}