def main():
	n,m,k=map(int,input().split())
	a=list()
	for i in range(n+1):
		a.append(int(input()))
	dp=[[0 for i in range(m+1)] for j in range(n+1)]
	dp[0][0]=k
	ans=0
	for i in range(1,n+1):
		for j in range(m+1):
			dp[i][j]=max(dp[i][j],dp[i-1][j])
			if j>0:
				for l in range(i):
					dp[i][j]=max(dp[i][j],dp[l][j-1]%a[l]+int(dp[l][j-1]//a[l])*a[i])
			ans=max(ans,dp[i][j])
	print(ans)

if __name__=="__main__":
	main()