#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

long long gcd(long long a, long long b){
	if(b==0) return a;
	return gcd(b, a%b);
}

long long lcm(long long a, long long b){
	if(a<b) swap(a,b);
	if(b==1) return a;
	return a * (b/gcd(a,b));
}


bool comp(pair<long long,long long>& a, pair<long long,long long>& b){
	long long lcm_ = lcm(a.second, b.second);
	return a.first * (lcm_/a.second) > b.first * (lcm_/b.second);
}

int main(){
	int n;
	long long v;
	cin >> n >> v;
	vector<long long> c(n);
	for(int i=0; i<n; i++){
		cin >> c[i];
	}
	vector<long long> d(n+1, 0);
	for(int i=0; i<n; i++){
		d[i+1] = c[i] + d[i];
	}

	long long ans = d[n];
	v -= n;

	if(v <= 0){
		cout << ans << endl;
		return 0;
	}

	vector<long long> dp(n*n*n, 1LL<<58);
	dp[0] = 0;
	for(int i=0; i<dp.size(); i++){
		for(int k=0; k<=n && i+k<dp.size(); k++){
			dp[i+k] = min(dp[i+k], dp[i] + d[k]);
		}
	}

	pair<long long, long long> best = {d[1],1};
	for(int i=2; i<=n; i++){
		pair<long long,long long> next = {d[i], i};
		if(comp(best, next)){
			best = next;
		}
	}

	long long lb = -1;
	long long ub = v/best.second +1;
	while(ub-lb>1){
		long long mid = (ub+lb)/2;
		long long rem = v - best.second * mid;
		if(rem >= dp.size()){
			lb = mid;
		}else{
			ub = mid;
		}
	}

	ans += best.first * ub;
	v -= best.second * ub;


	ans += dp[v];
	cout << ans << endl;
	return 0;
}