#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

// int getLIS(vector<int>& v){
//   vector<int> dp(v.size()+1, 1e7);
//   dp[0] = -1;
//   int lis_len = 1;
//   for(int i=0; i<v.size(); i++){
//     for(int j=i; j>=0; j--){
//       if( dp[j] == 1e7 ) continue;
//       if( v[i] > dp[j] ){
//         dp[j+1] = min(dp[j+1], v[i]);
//         lis_len = max(lis_len, j+1);
//       }
//     }
//   }
//   return lis_len;
// }

// int getLDS(vector<int>& v){
//   vector<int> dp(v.size()+1, -1e7);
//   dp[0] = v.size();
//   int lds_len = 1;
//   for(int i=0; i<v.size(); i++){
//     for(int j=i; j>=0; j--){
//       if( dp[j] == -1e7 ) continue;
//       if( v[i] < dp[j] ){
//         dp[j+1] = max(dp[j+1], v[i]);
//         lds_len = max(lds_len, j+1);
//       }
//     }
//   }
//   return lds_len;
// }

const int inf = 99999999;
#define index_of(as, x) \
  distance(as.begin(), lower_bound(as.begin(), as.end(), x))
vector<int> lis_fast(const vector<int>& a) {
  const int n = a.size();
  vector<int> A(n, inf);
  vector<int> id(n);
  for (int i = 0; i < n; ++i) {
    id[i] = index_of(A, a[i]);
    A[ id[i] ] = a[i];
  }
  int m = *max_element(id.begin(), id.end());
  vector<int> b(m+1);
  for (int i = n-1; i >= 0; --i)
    if (id[i] == m) b[m--] = a[i];
  return b;
}

int main(){
  int n,a,b;
  cin >> n,a,b;

  // vector<int> v(n);
  // iota(v.begin(), v.end(), 0);
  // map<pair<int,int>, vector<int>> dict;
  // do{
  //   int a = getLIS(v);
  //   int b = getLDS(v);
  //   eprintln(v, ":", a,b);
  //   dict[{a,b}] = v;
  // }while(next_permutation(v.begin(), v.end()));

  if( a+b > n+1 ){
    println(-1);
    return 0;
  }

  if( n==1 ){
    println(1);
    return 0;
  }

  if( a+b == n+1 ){
    vector<int> v(n);
    iota(v.begin(), v.end(), 1);
    reverse(v.begin()+a-1, v.end());
    println(v);
    return 0;
  }

  if( a>=b ){
    int x = (n+b-1)/b;
    int y = b;

    vector<vector<int>> block(x);
    for(int i=0, j=0; i<n; i+=y, j++){
      int l = i;
      int r = min(i+y, n);
      
      vector<int> v(r-l);
      iota(v.rbegin(), v.rend(), l);
      block[j] = v;
    }

    for(int j=block.size()-1; j>0; j--){
      int d = a - x;
      d = min<int>( block[j].size()-1, d );
      if(d<=0) continue;

      sort(block[j].begin(), block[j].begin()+d+1);
      x += d;
    }

    vector<int> v;
    for(int i=0; i<block.size(); i++){
      for(int j : block[i]){
        v.push_back(j + 1);
      }
    }
    int lis = lis_fast(v).size();
    vector<int> w(v.rbegin(), v.rend());
    int lds = lis_fast(w).size();

    if( lis == a && lds == b ){
      println(v);
    }else{
      println(-1);
    }
  }else{
    swap(a,b);

    int x = (n+b-1)/b;
    int y = b;

    vector<vector<int>> block(x);
    for(int i=0, j=0; i<n; i+=y, j++){
      int l = i;
      int r = min(i+y, n);
      
      vector<int> v(r-l);
      iota(v.rbegin(), v.rend(), l);
      block[j] = v;
    }

    for(int j=block.size()-1; j>0; j--){
      int d = a - x;
      d = min<int>( block[j].size()-1, d );
      if(d<=0) continue;

      sort(block[j].begin(), block[j].begin()+d+1);
      x += d;
    }

    vector<int> v;
    for(int i=0; i<block.size(); i++){
      for(int j : block[i]){
        v.push_back(j + 1);
      }
    }
    int lis = lis_fast(v).size();
    vector<int> w(v.rbegin(), v.rend());
    int lds = lis_fast(w).size();

    if( lis == a && lds == b ){
      println(w);
    }else{
      println(-1);
    }

  }

  return 0;
}


Measured memory_bytes: 9496