#include<iostream>
using namespace std;
//參數(shù)x表示開始元素的下標，m,n用于確定4條邊盡頭。
//a,b則用于判斷是否可進行螺旋。p為二維數(shù)組。
void lx(int x,int m, int n, int a, int b, int **p);
int main()
{
  //輸入行列
 int m = 0, n = 0;
 cin >> m >> n;
 int **a = new int*[m];
 for (int i = 0; i < m; ++i)
 a[i] = new int[n];
 a[0][0] = 1;
 //調(diào)用lx函數(shù)
 lx(0,m,n,m,n,a);
 //輸出螺旋數(shù)組
  for (int i = 0; i < m; ++i)
 {
 for (int j = 0; j < n; ++j)
  cout << a[i][j] << ' ';
 cout << endl;
 }
 //別忘了刪動態(tài)內(nèi)存
 for (int i = 0; i < m; ++i)
 delete []a[i];
 delete[]a;

}

void lx(int x ,int m, int n,int a,int b,int **p)
{
//如果x不為0，則首元素的值為前一個元素值加一。
 if (x)
 p[x][x] = p[x][x - 1] + 1;
//完成四條邊的賦值
 for (int i = x+1; i < n; ++i)
 p[x][i] = p[x][i - 1] + 1;

 for (int j = x+1; j < m; ++j)
 p[j][n - 1] = p[j - 1][n - 1] + 1;
 if(a>1)
 for (int i = n - 2; i >= x; --i)
 p[m - 1][i] = p[m - 1][i + 1] + 1;
 if(b>1)
 for (int j = m - 2; j >= x+1; --j)
 p[j][x] = p[j + 1][x] + 1;
//判斷是否符合螺旋條件，從而判斷是否調(diào)用lx函數(shù)
 if ((a - 2 > 0) && (b - 2 > 0))
 lx(x + 1,m - 1, n - 1,a-2,b-2, p);
 
}

void printValue(int head,int x,int y,int n)
{
 int NextHead = head + 4*n -4;
 head = head -1;
 if(x==n)
 {
 cout << (n+y-1)+head <<" ";
 if(!head) cout<<endl;
 }
 else if(y == 1)
 {
 cout<< x + head<<" ";
 }
 else if(x==1)
 {
 cout << (4*n-2)-y +head<< " ";
 }
 else if(y==n)
 {
 cout << 3*n-1-x + head << " ";
 }
 else
 {
 printValue(NextHead,x-1,y-1,n-2);
 }
}
void SpiralNumber(int n)
{
 for (int y = 1;y<=n;y++)
 {
 for (int x = 1;x<=n;x++)
 {
  printValue(1,x,y,n);
 }
 }
}