#include <bits/stdc++.h>
const long long mod = 1000000007;
using namespace std;
int main() {
  int n, a, b;
  scanf("%d %d %d", &n, &a, &b);
  if (n > a * b) {
    puts("-1");
    return 0;
  }
  vector<vector<int>> pole(a, vector<int>(b, 0));
  int cur = 1;
  for (int i = 0; i < a; i++) {
    if (i % 2 == 0) {
      for (int j = 0; j < b; j++) {
        pole[i][j] = cur;
        cur++;
        if (cur > n) break;
      }
      if (cur > n) break;
    } else {
      for (int j = b - 1; j >= 0; j--) {
        pole[i][j] = cur;
        cur++;
        if (cur > n) break;
      }
      if (cur > n) break;
    }
    if (cur > n) break;
  }
  for (int i = 0; i < a; i++) {
    for (int j = 0; j < b; j++) printf("%d ", pole[i][j]);
    printf("\n");
  }
  return 0;
}
