#include <cstring>
#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
typedef pair<int,int> Pair;
const int INF = 1e9+7;

LL n, a, b, v[1000001];

int main(){
	scanf("%lld%lld%lld", &n, &a, &b);
	if (n>a*b || n<a+b-1) return puts("-1")&0;
	
	a=n-a;
	for (int i=1; i<=n; ++i) v[i]=i;
	for (int i=1; i<=n && a; i+=b)
		if (a>=b-1)
			reverse(v+i, v+i+b), a-=b-1;
		else
			reverse(v+i, v+i+a+1), a=0;
	for (int i=1; i<=n; ++i) printf("%lld ", v[i]);
	return 0;
}
