#include<bits/stdc++.h>
using namespace std;
int n,m,a[101][101],k=1,c=1;
int fx[4]={0,1,0,-1};
int fy[4]={1,0,-1,0};
void dfs(int x,int y){
	c++;
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&a[tx][ty]==0){
			k++;
			a[tx][ty]=k;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i][j]==c){
				dfs(i,j);
			}
		}
	}
}
int main(){
   cin>>n>>m;
   a[1][1]=1;
   dfs(1,1);
   for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
   return 0;
}

/**************************************************************
	Problem: 1751
	User: chenjingqi
	Language: C++
	Result: Accepted
	Time:117 ms
	Memory:2448 kb
****************************************************************/