#include <bits/stdc++.h>
using namespace std;
bool mark[105 * 105];
int g[105][105], n, m;
bool flag;
int ABS(int x) {
  if (x < 0) x = -x;
  return x;
}
void dfs(int x, int y) {
  int i, j;
  if (flag) return;
  if (x == n + 1 && y == 1) {
    flag = 1;
    for (i = 1; i <= n; i++) {
      for (j = 1; j < m; j++) {
        printf("%d ", g[i][j]);
      }
      printf("%d\n", g[i][j]);
    }
    return;
  }
  for (i = 1; i <= n * m; i++) {
    if (mark[i] == 0) {
      if (ABS(i - g[x - 1][y]) > 1 && ABS(i - g[x][y - 1]) > 1) {
        mark[i] = 1;
        g[x][y] = i;
        if (y == m) {
          dfs(x + 1, 1);
          mark[i] = 0;
        } else {
          dfs(x, y + 1);
          mark[i] = 0;
        }
      }
    }
  }
}
int main() {
  int i, j;
  flag = 0;
  scanf("%d%d", &n, &m);
  for (i = 0; i <= m + 1; i++) g[0][i] = g[n + 1][i] = -3;
  for (i = 0; i <= n + 1; i++) g[i][0] = g[i][m + 1] = -3;
  memset(mark, 0, sizeof(mark));
  dfs(1, 1);
  if (flag == 0) printf("-1\n");
}
