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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, m, k, a[391];
         LL  dp1[392][22]; // 金
pair<LL, LL> dp2[392][22]; // <株, 金>


int main() {
	cin >> n >> m >> k;
	n++;
	inc(i, n) { cin >> a[i]; }
	
	dp1[0][0] = k;
	inc(i, n) {
	incII(j, 0, m) {
		setmax(dp1[i + 1][j], dp1[i][j]);
		setmax(dp2[i + 1][j], dp2[i][j]);
		setmax(dp2[i + 1][j], MP(dp1[i][j] / a[i], dp1[i][j] % a[i])); // 買
		setmax(dp1[i + 1][j + 1], a[i] * dp2[i][j].FI + dp2[i][j].SE); // 売
	}
	}
	
	LL ans = 0;
	incII(j, 0, m) {
		setmax(ans, dp1[n][j]);
		setmax(ans, a[n - 1] * dp2[n][j].FI + dp2[n][j].SE); // 終値での現金化を数えないならこの行がいる
	}
	
	cout << ans << endl;
	
	return 0;
}