import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No0115 {
    
    static final Scanner in = new Scanner(System.in);
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve() {
        int n = in.nextInt();
        int d = in.nextInt();
        int K = in.nextInt();

        String[][][] dp = new String[n+1][2000][K+2];
        dp[0][0][0] = "";

        for (int i=0; i<n; i++) {
        	for (int j=0; j<=d; j++) {
        		for (int k=0; k<=K; k++) {
        			if (dp[i][j][k] == null) continue;
        			dp[i+1][i+j+1][k+1] = 
        				(dp[i+1][i+j+1][k+1] == null || dp[i+1][i+j+1][k+1].compareTo(dp[i][j][k]+(char)(i+1)) > 0)
        				? (dp[i][j][k]+(char)(i+1)) : dp[i+1][i+j+1][k+1];
        			dp[i+1][j][k] = (dp[i+1][j][k] == null || dp[i+1][j][k].compareTo(dp[i][j][k]) > 0)
        				? dp[i][j][k] : dp[i+1][j][k];
        		}
        	}
        }
        
        if (dp[n][d][K] == null) {
        	out.println("-1");
        } else {
        	for(int i=0; i<dp[n][d][K].length()-1; i++) {
        		out.print((int)dp[n][d][K].charAt(i)+" ");
        	}
        	out.println((int)dp[n][d][K].charAt(dp[n][d][K].length()-1));
        }
    }

    public static void main(String[] args) {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}