#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int main(){
    int n, m, k;
    cin >> n >> m >> k;
    vector<ll> a(n+1), dp(n+1, k), tmp(n+1);
    for(ll& i: a) cin >> i;
    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=0; 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;
}