N,M,money=map(int,input().split())
prices = [int(input()) for i in range(N+1)]
dp = [[0 for j in range(M+1)]for i in range(N+1)]
dp[0][0] = money
max_p = money

for i in range(1,N+1):
    for j in range(M+1):
        dp[i][j]=dp[i-1][j]
        if j>0:
            for l in range(i):
                x = dp[l][j-1]%prices[l] + dp[l][j-1]//prices[l]*prices[i]
                if dp[i][j]<x:
                    dp[i][j]=x
            if max_p<dp[i][j]:
                max_p=dp[i][j]
print(max_p)