#include<algorithm>
using namespace std;
int b[1000000];
int main ()
{int p,i,k;
    freopen("tablete.in","r",stdin);
    freopen("tablete.out","w",stdout);
    int n,m;
   scanf("%d%d",&n,&m); 
    int a[n+2][n+2];
  
    for(i=n;i>=1;i--)
    for(k=n;k>=1;k--)
    {
                     for(p=n*n;p>=1;p--)
                     {if(!b[p])
                     {if((k==m && p%2==0 ) || k!=m )
                     {     if(a[i][k+1]>p || k==n)
                     {  a[i][k]=p;
                               b[p]=1;
                           //      printf("%d %d %d %d\n",p,a[i][k],i,k);
                                 break;}
                              }
                              }
                              }
                              }
    for(i=1;i<=n;i++)
    {
    for(k=1;k<=n;k++)
   printf("%d ",a[i][k]) ;printf("\n");}  
                                               
}