#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, a, b;
int ans[N][N];
vector<int> demo, rep;
int main() {
  scanf("%d%d%d", &n, &a, &b);
  for (int i = 1; i <= n; ++i) {
    if (i & 1)
      demo.push_back(i);
    else
      rep.push_back(i);
  }
  for (int i = 0; i < a; ++i) {
    for (int j = 0; j < b; ++j) {
      if (!((i + j) & 1)) {
        if (demo.size()) {
          ans[i][j] = demo.back();
          demo.pop_back();
        }
      } else {
        if (rep.size()) {
          ans[i][j] = rep.back();
          rep.pop_back();
        }
      }
    }
  }
  if (demo.empty() && rep.empty()) {
    for (int i = 0; i < a; ++i) {
      for (int j = 0; j < b; ++j) {
        printf("%d%c", ans[i][j], " \n"[j == b - 1]);
      }
    }
  } else {
    puts("-1");
  }
  return 0;
}
