#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
int f[407][21], n, m, k, a[407];
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> k;
    n++;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 0; i <= n; i++)
        f[i][0] = k;
    for (int i = 2; i <= n; i++)
    {
        for (int k = 0; k <= m; k++)
            f[i][k] = f[i - 1][k];

        for (int j = 1; j < i; j++)
            for (int k = 1; k <= m; k++)
                f[i][k] = max(f[i][k], f[j][k - 1] % a[j] + f[j][k - 1] / a[j] * a[i]);
    }
    int res = 0;
    for (int k = 0; k <= m; k++)
        res = max(res, f[n][k]);
    cout << res;
}