#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

const ll INF = (1LL << 60);

ll profit(ll k, ll x, ll y) {
  return k % x + k / x * y;
}

int main(void) {
  ll N, M, K;
  cin >> N >> M >> K;
  vector<ll> A(N + 1);
  REP(i, 0, N + 1) cin >> A[i];

  // let i in [0, M), j in [0, N]
  // dp[i][j]: i + 1回売って, 最後に売ったのが時刻jの場合の最大の利益
  vector< vector<ll> > dp(M, vector<ll>(N + 1, -INF));
  REP(i, 0, N + 1) REP(j, 0, i + 1) {
    dp[0][i] = max(dp[0][i], profit(K, A[j], A[i]));
  }
  REP(i, 0, M - 1) REP(j, 0, N + 1) {
    ll m = INF;
    REP(k, j + 1, N + 1) {
      m = min(m, A[k]);
      dp[i + 1][k] = max(dp[i + 1][k], profit(dp[i][j], m, A[k]));
    }
  }

  ll ans = K;
  REP(i, 0, M) REP(j, 0, N + 1) ans = max(ans, dp[i][j]);
  cout << ans << endl;
}