#include <bits/stdc++.h>
#pragma comment(linker, "/stack:256000000")
using namespace std;
void prepare() {}
int n, m;
int a[105][105];
bool f[105 * 105];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
bool can(int x, int y, int k) {
  for (int i = 0; i < 4; i++) {
    int xx = x + dx[i];
    int yy = y + dy[i];
    if (xx >= 0 && xx < n && yy >= 0 && yy < m && a[xx][yy] &&
        abs(k - a[xx][yy]) <= 1)
      return false;
  }
  return true;
}
bool go(int x, int y) {
  if (y == m) {
    x++;
    y = 0;
    if (x == n) return true;
  }
  for (int i = 1; i <= n * m; i++) {
    if (!f[i] && can(x, y, i)) {
      a[x][y] = i;
      f[i] = true;
      if (go(x, y + 1)) return true;
      a[x][y] = 0;
      f[i] = false;
    }
  }
  return false;
}
bool check() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == 0) return false;
      for (int k = 0; k < 4; k++) {
        int x = i + dx[k];
        int y = j + dy[k];
        if (x >= 0 && x < n && y >= 0 && y < m && abs(a[i][j] - a[x][y]) <= 1)
          return false;
      }
    }
  }
  return true;
}
void solve() {
  memset((f), (0), sizeof(f));
  memset((a), (0), sizeof(a));
  scanf("%d%d", &n, &m);
  if (go(0, 0)) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) printf("%d ", a[i][j]);
      printf("\n");
    }
  } else
    printf("-1\n");
}
int main() {
  prepare();
  solve();
  return 0;
}
