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

int arr[300005];
int n, a, b;

void fail()
{
	printf("-1\n");
	exit(0);
}

int main()
{
	scanf("%d%d%d", &n, &a, &b);
	if (a+b > n+1) fail();
	if (b < (n+a-1)/a) fail();
	for (int i = 0;i < n;i++) arr[i] = max(0, n-a*(i/a+1))+(i%a)+1;
	for (int i = 0;i < n;i++) if (i/a+n-i == b)
	{
		int d = min(a, (n/a==i/a)?n%a:a)-i%a-1;
		for (int j = i/a*a;j <= i;j++) arr[j] += d;
		for (int j = i+1;j < n;j++) arr[j] = n-j;
		break;
	}
	for (int i = 0;i < n;i++) printf("%d%c", arr[i], " \n"[i+1==n]);
	return 0;
}
