#include <bits/stdc++.h>
typedef long long LL;
const double INF = 1e100;
const int oo = ~0u >> 2;
const double pi = acos(-1.0);
const double EPS = 1e-8;
const int MAXN = 100033;
int n, a, b;
int cur = 1;
int s[133][133];
int main() {
  scanf("%d%d%d", &n, &a, &b);
  for (int i = (1), __ = (a); i <= __; ++i) {
    if (i & 1)
      for (int j = (1), __ = (b); j <= __; ++j) {
        if (cur <= n) s[i][j] = cur++;
      }
    else
      for (int j = (b), __ = (1); j >= __; --j) {
        if (cur <= n) s[i][j] = cur++;
      }
  }
  if (cur != n + 1) {
    puts("-1");
    return 0;
  }
  for (int i = (1), __ = (a); i <= __; ++i) {
    for (int j = (1), __ = (b); j <= __; ++j) printf("%d ", s[i][j]);
    puts("");
  }
  return 0;
}
