#include <bits/stdc++.h>
using namespace std;
void sc(int& a) { scanf("%d", &a); }
void sc(long long int& a) { scanf("%lld", &a); }
void sc(int& a, int& b) {
  sc(a);
  sc(b);
}
void sc(long long int& a, long long int& b) {
  sc(a);
  sc(b);
}
void sc(int& a, int& b, int& c) {
  sc(a, b);
  sc(c);
}
void sc(long long int& a, long long int& b, long long int& c) {
  sc(a, b);
  sc(c);
}
void prl(int a) { printf("%d\n", a); }
void prl(long long int a) { printf("%lld\n", a); }
void prl() { printf("\n"); }
void prs(int a) { printf("%d ", a); }
void prs(long long int a) { printf("%lld ", a); }
void prl(long long int a, long long int b) {
  cout << a << " " << b << " " << endl;
}
void prl(long long int a, long long int b, long long int c) {
  cout << a << " " << b << " " << c << " " << endl;
}
void prl(long long int a, long long int b, long long int c, long long int d) {
  cout << a << " " << b << " " << c << " " << d << endl;
}
void prl(long long int a, long long int b, long long int c, long long int d,
         long long int e) {
  cout << a << " " << b << " " << c << " " << d << " " << e << endl;
}
void prl(long long int a, long long int b, long long int c, long long int d,
         long long int e, long long int f) {
  cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;
}
int mod = 1000000007;
long long int modpow(long long int a, long long int b, long long int mod) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b = b / 2;
  }
  return res % mod;
}
long long int pow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a);
    a = (a * a);
    b = b / 2;
  }
  return res;
}
const int MAX = 10000000;
int a[100][100];
int main() {
  int m, x, y;
  for (int i = 0; i < 100; i++)
    for (int j = 0; j < 100; j++) a[i][j] = 0;
  sc(m);
  sc(x, y);
  int o = 1;
  int e = 2;
  for (int i = 0; i < x; i++)
    for (int j = 0; j < y; j++) {
      if ((i + j) % 2 == 1 && e <= m) {
        a[i][j] = e;
        e = e + 2;
      } else if ((i + j) % 2 == 0 && o <= m) {
        a[i][j] = o;
        o = o + 2;
      }
      if (o > m && e > m) break;
    }
  if (o > m && e > m) {
    for (int i = 0; i < x; i++) {
      for (int j = 0; j < y; j++) {
        prs(a[i][j]);
      }
      prl();
    }
  } else
    printf("-1\n");
}
