#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q,K;

template<typename T> class ST {
    using F = function<T(T, T)>;
    int size;
    T init;
    F f;
    vector<T> seg;
    int depth = 0;
    
public: ST(int size, T init, F f): size(size), init(init), f(f) {
    while (1<<depth < size) depth++;
    seg.assign(2<<depth, init);
}
    
    void update(int k, T t) {
        k += 1 << depth;
        seg[k] = t;
        while(k>>=1) seg[k] = f(seg[2*k], seg[2*k+1]);
    }
    
    T query(int a, int b) {
        a += 1<<depth;
        b += 1<<depth;
        T l = init;
        T r = init;
        while(a < b) {
            if (a & 1) l = f(l, seg[a++]);
            if (b & 1) r = f(r, seg[--b]);
            a >>= 1;
            b >>= 1;
        }
        return f(l, r);
    }
    
    T operator[] (int k) {
        return seg[k + (1<<depth)];
    }
};

void solve() {
    cin>>N>>M>>K;
    
    auto S = ST<int>(N, 500, [](int a, int b) { return min(a, b); });
    
    int A[N+1];
    REP(i,N+1) {
        cin>>A[i];
        S.update(i, A[i]);
    }
    
    int ans = K;
    int DP[M+1][N+1]; // 残りM回, 売った時刻N => 手元資金
    REP(m,M+1) REP(n,N+1) DP[m][n]=K;
    
    RREP(m,M) REP(n,N+1) {
        int price = A[n];
        FOR(j,0,n) {
            int min_price = S.query(j, n);
            if (min_price >= price) continue;
            int count = DP[m+1][j]/min_price;
            DP[m][n] = max(DP[m][n], DP[m+1][j] + count*(price-min_price));
            ans = max(ans, DP[m][n]);
        }
    }
    
    cout << ans << endl;
}