#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

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

ll dp[404][21];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>K;
	FOR(i,N+1) cin>>A[i];
	
	ll ret=K;
	dp[0][M]=K;
	for(i=1;i<=N;i++) {
		for(j=0;j<=M;j++) {
			dp[i][j]=max(dp[i][j],dp[i-1][j]);
			if(j<M) for(x=0;x<i;x++) dp[i][j]=max(dp[i][j],dp[x][j+1]%A[x]+dp[x][j+1]/A[x]*A[i]);
			ret=max(ret,dp[i][j]);
		}
	}
	
	cout<<ret<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}