#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
#define vv(a,b,c,d) vector<vector<a> >(b,vector<a>(c,d))
#define vvv(a,b,c,d,e) vector<vector<vector<a> > >(b,vv(a,c,d,e))
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

// dp[分][持ち株] = 最大資金
ll dp[400][22];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);

    int N, M, K;
    cin >> N >> M >> K;
    N++;
    MEM(dp, -1);
    dp[0][0] = K;

    vi A(N);
    rep(i, N)cin >> A[i];

    rep(i, N) rep(j, M + 1) {
        ll cur = dp[i][j];
        if (cur == -1)continue;
        smax(dp[i + 1][j], cur);
        for (int ni = i + 1; ni < N; ++ni) {
            if (A[ni] > A[i]) {
                ll nex = cur / A[i] * A[ni] + cur%A[i];
                smax(dp[ni+1][j + 1], nex);
            }
        }
    }

    ll ans = -1;
    rep(i, M + 1)smax(ans, dp[N][i]);
    cout << ans << endl;
}