#include <bits/stdc++.h>
using namespace std;
int n, m;
int g[110][110];
int flg = 0;
int main() {
  scanf("%d%d", &n, &m);
  if (n == 1 && m == 1) {
    puts("1");
    return 0;
  }
  if (n + m <= 4) {
    puts("-1");
  } else {
    if (n == 1 || m == 1) {
      if (m == 1) {
        swap(n, m);
        flg = 1;
      }
      int ct = 0;
      for (int j = 2; j <= m; j += 2) g[1][j] = ++ct;
      for (int j = 1; j <= m; j += 2) g[1][j] = ++ct;
    } else {
      if ((n % 2 != 0 && m % 2 == 0) || (n % 2 == 0 && m % 2 == 0 && n > m)) {
        swap(n, m);
        flg = 1;
      }
      if (n % 2 != 0) {
        int ct = m / 2;
        for (int i = 1; i < n; i += 2) {
          for (int j = 1; j <= m; ++j)
            if (j & 1)
              g[i][j] = ++ct;
            else
              g[i + 1][j] = ++ct;
          for (int j = 1; j <= m; ++j)
            if (j & 1)
              g[i + 1][j] = ++ct;
            else
              g[i][j] = ++ct;
        }
        ct = n * m - m / 2 - 1;
        for (int j = 1; j <= m; j += 2) g[n][j] = ++ct;
        ct = 0;
        for (int j = 2; j <= m; j += 2) g[n][j] = ++ct;
      } else {
        int ct = 0;
        for (int i = 1; i <= n; i += 2) {
          for (int j = 1; j <= m; ++j)
            if (j & 1)
              g[i][j] = ++ct;
            else
              g[i + 1][j] = ++ct;
          for (int j = 1; j <= m; ++j)
            if (j & 1)
              g[i + 1][j] = ++ct;
            else
              g[i][j] = ++ct;
        }
      }
    }
    if (!flg) {
      for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) printf("%d ", g[i][j]);
        puts("");
      }
    } else {
      for (int j = 1; j <= m; ++j) {
        for (int i = 1; i <= n; ++i) printf("%d ", g[i][j]);
        puts("");
      }
    }
  }
  return 0;
}
