def f(a,b)
	return true if b==[]
	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+2).map{Array.new(k+2).map{Array.new(n+2,[])}}

n.times{|i|
	m2=i+1
	break if d<m2
	break if n<m2
	dp[m2][1][m2]=[m2]
}
(1..(k-1)).each{|i|
	d.times{|j|
		e0=j
		n.times{|j1|
			if dp[j][i][j1]==[]
				next
			end
			e0=j
			e1=dp[j][i][j1]
			((j1+1)..n).each{|add|
				e2=e0+add
				if dp.size<=e2
					break
				end
				e3=Marshal.load(Marshal.dump(e1))
				e3<<add
				if dp[e2][i+1][add]==[] || f(e3,dp[e2][i+1][add])==true
					dp[e2][i+1][add]=e3
				end
			}
		}
	}
}

ans=[]
n.times{|i|
	m2=i+1
	if f(dp[d][k][m2],ans)
		ans=dp[d][k][m2]
	end
}
if ans==[]
	puts -1
else
	puts ans*" "
end