#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
using namespace std;

int main() {
	int N,D,K;
	cin>>N>>D>>K;
	vector<int> ans;
	RREP(mask,1,(1<<N)){
		int sum=0;
		if(__builtin_popcount(mask)==K){
			REP(i,0,N){
				if(mask & (1<<i)) sum+=i+1;
			}
			if(sum==D){
				REP(i,0,N){
					if(mask & (1<<i)) ans.push_back(i+1);
				}
				break;
			}
		}
	}
	if(ans.empty()) cout<<-1<<endl;
	else{
		bool flag=false;
		for(auto p:ans){
			if(!flag) {
				cout<<p;
				flag=true;
			}else{
				cout<<" "<<p;
			}
		}
		cout<<endl;
	}
	return 0;
}