#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int ar[101][101];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, a, b;
  cin >> n >> a >> b;
  if (n > a * b) {
    cout << -1 << endl;
    return 0;
  }
  int cnt = 1;
  for (int i = 1; i <= a; i++) {
    if (b % 2 == 0 && i % 2 == 0) {
      for (int j = b; j >= 1; j--) {
        if (cnt > n) break;
        ar[i][j] = cnt++;
      }
    } else {
      for (int j = 1; j <= b; j++) {
        if (cnt > n) break;
        ar[i][j] = cnt++;
      }
    }
  }
  for (int i = (1); i < (a + 1); ++i) {
    for (int j = (1); j < (b + 1); ++j) cout << ar[i][j] << " ";
    cout << endl;
  }
}
