#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  int N, A, B; cin >> N >> A >> B;
  if ((ll)A * B < N or A + B - 1 > N) {
    cout << -1 << endl;
  } else {
    int cur {}, r { N - A };
    vector<int> ans;
    for (int i = 1; i <= A; i++) {
      int m = min(r, B - 1) + 1;
      r -= m - 1;
      for (int j = 0; j < m; j++) ans.push_back(cur + m - j);
      cur += m;
    }
    for (int i = 0; i < ans.size(); i++) {
      cout << ans[i] << ( (i == ans.size() - 1) ? '\n' : ' ' );
    }
  }
  return 0;
}
