#include "bits/stdc++.h"
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
const int inf = 1000000001;
const ll INF = 2e18;
const ll MOD = 1000000007;
const ll mod = 1000000009;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };


int main() {
	ll n, m, k;
	cin >> n >> m >> k;
	n++;
	vl a(n);
	rep(i, n) {
		cin >> a[i];
	}
	vll mi(n, vl(n + 1));
	rep(i, n) {
		ll temp = INF;
		for (int j = i + 1; j <= n; j++) {
			temp = min(temp, a[j - 1]);
			mi[i][j] = temp;
		}
	}
	vll dp(n + 1, vl(m + 1));
	dp[0][0] = k;
	rep1(j, m) {
		rep1(i, n) {
			rep(k, i) {
				dp[i][j] = max(dp[i][j], dp[k][j - 1] % mi[k][i] + dp[k][j - 1] / mi[k][i] * a[i - 1]);
			}
		}
	}
	ll ans = 0;
	rep(i, n + 1) {
		rep(j, m + 1) {
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans << endl;
}