import sys
readline=sys.stdin.readline

N,M,K=map(int,readline().split())
A=[int(readline()) for i in range(N+1)]
inf=1<<40
dp=[[-inf]*(M+1) for n in range(N+2)]
dp[0][0]=K
for n in range(1,N+2):
    for m in range(M+1):
        dp[n][m]=dp[n-1][m]
    for m in range(1,M+1):
        for nn in range(n):
            x,y=divmod(dp[nn][m-1],A[nn])
            dp[n][m]=max(dp[n][m],x*A[n-1]+y)
ans=max(dp[N+1])
print(ans)