#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    n++;
    vector<int> A(n);
    for (auto &&i : A) scanf("%d", &i);
    auto dp = make_v(n, m+1, (ll)k);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            for (int l = 0; l < m; ++l) {
                if(i)chmax(dp[i][l+1], dp[i-1][l+1]);
                chmax(dp[i][l+1], dp[i][l]);
                chmax(dp[i][l+1], dp[j][l]%A[j]+dp[j][l]/A[j]*A[i]);
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= m; ++j) {
            chmax(ans, dp[i][j]);
        }
    }
    cout << ans << "\n";
    return 0;
}