#include <bits/stdc++.h>
using namespace std;
bool cases(int n, int m) {
  if (n == 1 && m == 1) {
    cout << 1 << endl;
    return true;
  }
  if (n == 1 && m < 4) {
    cout << -1 << endl;
    return true;
  }
  if (m == 1 && n < 4) {
    cout << -1 << endl;
    return true;
  }
  if (n == 2 && m == 2) {
    cout << -1 << endl;
    return true;
  }
  return false;
}
int main() {
  int n, m;
  cin >> n >> m;
  if (cases(n, m)) return 0;
  int ans[n][m];
  memset(ans, -1, sizeof(ans));
  int k = 1;
  for (int i = n - 1; i >= 0; i--) {
    for (int j = m - 1; j >= 0; j--) {
      if ((i + j) % 2 == 0) {
        ans[i][j] = k++;
      }
    }
  }
  k = n * m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (ans[i][j] != -1) {
        cout << ans[i][j] << " ";
      } else {
        cout << k-- << " ";
      }
    }
    cout << endl;
  }
  return 0;
}
