#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
const int Nmax = 1000 + 5;
int n, k;
int a[Nmax][Nmax];
int main()
{
    fin >> n >> k;
    if(k % 2 == 0)
    {
        int nr = 1;
        for(int i = 1 ; i <= n ;++i)
            for(int j = 1; j <= k; ++j)
                a[i][j] = nr, nr++;
        for(int i =1 ; i <= n ; ++i)
            for(int j = k+1; j <= n; ++j)
                a[i][j] = nr, nr++;
    }
    else if(n%2 == 0 && k % 2 == 1)
    {
        int nr = 0;
        for(int l = 0; l < n / 2; ++l)
        {
            for(int i = l * 2 + 1; i <= (l+1) * 2; ++i, nr += k)
                for(int j = 1; j <= k; ++j)
                {
                    if(j == k && i == l  * 2 + 1)a[i][j]=nr + k + 1;
                    else if(j == 1 && i == (l+1) * 2)a[i][j] = nr;
                    else a[i][j] = nr + j;
                }
        }
        nr++;
        for(int i = 1; i <= n; ++i)
            for(int j = k +1 ; j <= n; ++j)
                a[i][j] = nr, nr ++;
    }
    else
    {
        int nr = 0;
        for(int l = 0; l < n / 2; ++l)
        {
            for(int i = l * 2 + 1; i <= (l+1) * 2; ++i, nr += k)
                for(int j = 1; j <= k; ++j)
                {
                    if(j == k && i == l  * 2 + 1)a[i][j]=nr + k + 1;
                    else if(j == 1 && i == (l+1) * 2)a[i][j] = nr;
                    else a[i][j] = nr + j;
                }
        }
        for(int j = 1; j <= k; ++j)
            a[n][j]=(n-1) * k + j;
        a[n][k]++;nr+=k;
        nr++;
        for(int i = 1; i <= n; ++i)
            for(int j = k +1 ; j <= n; ++j)
                a[i][j] = nr, nr ++;
        a[1][k+1]--;
    }
    for(int i = 1; i <= n; ++i,fout<<'\n')
        for(int j = 1; j <= n; ++j)
            fout << a[i][j] <<" ";
    return 0;
}