//Create Time: 2018-04-28 10:16:19
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef tuple<int,int,int> tp;
/****head****/
const int N=(int)3e5+9;
int ans[N];
pii stk[N];
void gao(int l,int r,int c){
    if(c==0)return;
    static int s[N],m;
    m=0;
    rep(i,r-c,r)s[m++]=ans[i];
    for(int i=r-c-1,j=r-1;i>=l;--i,--j)
        ans[j]=ans[i];
    int i=l;
    while(m>0)ans[i++]=s[--m];
}
int main(){
    int n,a,b;cin>>n>>a>>b;
    if(n<a){puts("-1");return 0;}
    int m=0,top=0;
    for(int i=n+1,t;i>1;i=t){
        t=max(i-a,1);
        // OUT(t,i);
        int tm=m;
        rep(j,t,i)ans[m++]=j;
        stk[top++]={tm,m};
        --b;
    }
    // rep(i,0,m)TST(ans[i]);puts("");
    // OUT(top);
    // rep(i,0,top)OUT(stk[i].x,stk[i].y);
    while(b>0 && top>1){
        int l=stk[top-1].y-stk[top-1].x;
        if(b>l-1){
            gao(stk[top-1].x,stk[top-1].y,l-1);
            b-=l-1;
        }else{
            gao(stk[top-1].x,stk[top-1].y,b);
            b=0;
        }
        --top;
    }
    if(b!=0)puts("-1");
    else rep(i,0,n)printf("%d%c",ans[i]," \n"[i==n-1]);
    return 0;
}


Measured memory_bytes: 4224