#include #define rep(i, begin, end) for(int i = begin; i < end; i++) template auto make_vector(size_t sz, T t) { return std::vector(sz, t); } template = nullptr> auto make_higher_vector(size_t sz, U u) { return make_vector(sz, T(u)); } template = nullptr> auto make_higher_vector(size_t sz) { return std::vector(sz); } template = nullptr> auto make_higher_vector(size_t a, Args... args) { return make_vector(a, make_higher_vector(args...)); } template auto& at(T& t, Size_t i) { return t.at(i); } template auto& at(T& t, Size_t i, Args... args) { return at(t.at(i), args...); } template inline auto cmn (T& a, U b) {if (a > b) {a = b; return true;} return false;} template inline auto cmx (T& a, U b) {if (a < b) {a = b; return true;} return false;} int main() { std::cin.tie(0); std::cin.sync_with_stdio(false); int n, m, k; std::cin >> n >> m >> k; std::vector a(n + 1); for (auto& x : a) std::cin >> x; auto dp = make_higher_vector<2, long long>(n + 2, m + 1, k); rep(i, 0, n + 1) rep(j, 0, m + 1) { auto crr = at(dp, i, j); cmx(at(dp, i + 1, j), crr); if (j < m) { cmx(at(dp, i, j + 1), crr); rep(k, i + 1, n + 1) { cmx( at(dp, k + 1, j + 1), crr % a.at(i) + crr / a.at(i) * a.at(k) ); } } } std::cout << dp.back().back() << std::endl; return 0; }