n,m,k=map(int,input().split())
a=list(map(int,input().split()))
def f(v,c,i):
	if m<v:
		return 0
	if i==n or c==k:
		return v
	res=v
	for j in range(k-c+1):
		res=max(res,f(v+j*a[i],c+i,i+1))
	return res
print(f(0,0,0))