#include <bits/stdc++.h>
using namespace std;
int quick_pow(int a, int b, int MOD) {
  a %= MOD;
  int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    b /= 2;
    a = (a * a) % MOD;
  }
  return res;
}
const int maxn = 100000 + 10;
int c[110][110];
int main() {
  int i, j, n, a, b;
  while (scanf("%d%d%d", &n, &a, &b) != EOF) {
    if (n > a * b) {
      puts("-1");
      continue;
    }
    memset(c, 0, sizeof(c));
    int odd = -1, even = 0;
    for (i = 1; i <= a; i++) {
      for (j = 1; j <= b; j++) {
        if ((i + j) % 2 == 0) {
          odd += 2;
          if (odd <= n) c[i][j] = odd;
        } else {
          even += 2;
          if (even <= n) c[i][j] = even;
        }
      }
    }
    for (i = 1; i <= a; i++)
      for (j = 1; j <= b; j++) printf("%d%c", c[i][j], " \n"[j == b]);
  }
  return 0;
}
