#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int N, M, K;
ll A[400];

int main() {
  cin >> N >> M >> K;

  memset(A, 0, sizeof(A));
  for (int i = 1; i <= N + 1; ++i) {
    cin >> A[i];
  }

  ll dp[N + 2][M + 1];
  memset(dp, 0, sizeof(dp));
  dp[1][0] = K;

  for (int i = 1; i <= N; ++i) {
    ll a = A[i];

    for (int m = 0; m <= M; ++m) {
      dp[i + 1][m] = max(dp[i + 1][m], dp[i][m]);
    }

    for (int j = i + 1; j <= N + 1; ++j) {
      ll na = A[j];

      for (int m = 0; m < M; ++m) {
        ll k = dp[i][m];
        ll cnt = k / a;
        ll remain = k % a;
        ll nk = cnt * na + remain;

        dp[j][m + 1] = max(dp[j][m + 1], nk);
      }
    }
  }

  ll ans = K;

  for (int m = 0; m <= M; ++m) {
    ans = max(ans, dp[N + 1][m]);
  }

  cout << ans << endl;

  return 0;
}