#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k = 1;
  int q[101][101] = {
      0,
  };
  cin >> n >> a >> b;
  if (a * b < n) {
    cout << -1;
    return 0;
  }
  if (b % 2 != 0)
    for (int i = 0; i < a; i++)
      for (int j = 0; j < b; j++) {
        q[i][j] = k;
        k++;
        if (k > n) {
          for (int o = 0; o < a; o++) {
            for (int p = 0; p < b; p++) cout << q[o][p] << " ";
            cout << endl;
          }
          return 0;
        }
      }
  for (int i = 0; i < a; i += 2) {
    for (int j = 0; j < b; j++) {
      if (k <= n) q[i][j] = k;
      ++k;
    }
    k += b;
  }
  k = b + 1;
  for (int i = 1; i < a; i += 2) {
    for (int j = b - 1; j >= 0; j--) {
      if (k <= n) q[i][j] = k;
      ++k;
    }
    k += b;
  }
  for (int i = 0; i < a; i++) {
    for (int j = 0; j < b; j++) cout << q[i][j] << " ";
    cout << endl;
  }
  return 0;
}
