#include <iostream>
using namespace std;
#define ll long long
ll a[391], dp[391], tmp[391];
int main(){
    int n, m, k;
    cin >> n >> m >> k;
    ++n;
    for(int i=1; i<=n; ++i) cin >> a[i];
    for(int i=0; i<=n; ++i) dp[i] = k;
    tmp[0] = k;
    for(int j=1; j<=m; ++j){
        for(int i=1; i<=n; ++i){
            tmp[i] = tmp[i-1];
            for(int k=1; k<i; ++k)
                tmp[i] = max(tmp[i], dp[k]%a[k]+dp[k]/a[k]*a[i]);
        }
        swap(dp, tmp);
    }
    cout << dp[n] << endl;
    return 0;
}