n,m,k,*a = map(int,open(0).read().split())
n += 1
dp = [[-1]*(m+1)]
dp[0][0] = k
for i in range(n):
    ndp = dp[-1][:]
    for j in range(1,m+1)[::-1]:
        if ndp[j-1] == -1: continue
        for l in range(i):
            if a[i] > a[l]:
                ndp[j] = max(ndp[j], dp[l][j-1]%a[l] + dp[l][j-1]//a[l]*a[i])
    dp.append(ndp)
print(max(dp[-1]))