#include <bits/stdc++.h>
using namespace std;
const int Maxn = 10000 + 10;
int f[110][110], n, r, c;
bool pd;
int main() {
  scanf("%d%d%d", &n, &r, &c);
  if (r * c < n) {
    printf("-1\n");
    exit(0);
  }
  pd = 0;
  if (c % 2 == 0) pd = 1;
  if (pd == 0) {
    int op = 1;
    for (int i = 1; i <= r; ++i)
      for (int j = 1; j <= c; ++j) {
        if (op <= n) f[i][j] = op;
        op++;
      }
  } else {
    int op = 1;
    for (int i = 1; i <= r; ++i)
      if (i % 2 == 1) {
        for (int j = 1; j <= c; ++j) {
          if (op <= n) f[i][j] = op;
          op++;
        }
      } else {
        for (int j = c; j >= 1; --j) {
          if (op <= n) f[i][j] = op;
          op++;
        }
      }
  }
  for (int i = 1; i <= r; ++i) {
    for (int j = 1; j <= c; ++j) printf("%d ", f[i][j]);
    printf("\n");
  }
  fclose(stdout);
  return 0;
}
