def f(a,b)
	if b==nil
		return true
	end
	a.size.times{|i|
		return a[i]<b[i] if a[i]!=b[i]
	}
	return false
end

n,d,k=gets.split.map{|e| e.to_i}
dp = Array.new(d+1).map{Array.new(k+1,[])}

n.times{|i|
	m=i+1
	break if m>=dp.size
	dp[m][1]=[m,[m]]
}
(1..(k-1)).each{|i|
	d.times{|j|
		if dp[j][i]==[]
			next
		end
		e0=dp[j][i][0]
		e1=dp[j][i][1]
		((e1.last+1)..n).each{|add|
			e2=e0+add
			if dp.size<=e2
				break
			end
			e3=Marshal.load(Marshal.dump(e1))
			e3<<add
			if f(e3,dp[e2][i+1][1])==true
				dp[e2][i+1]=[e2,e3]
			end
		}
	}
}
if dp[d][k][1]==nil
	puts -1
else
	puts dp[d][k][1]*" "
end