#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
ll c[100];
ld d[100]; int e[100];
ll ssum[100];int n; ll v;
bool used[20001];
ll memo[20001];
ll dfs(ll x) {
	if (x < 0)return INF;
	if (used[x])return memo[x];
	ll res = INF;
	rep1(i, n) {
		res = min(res, dfs(x - i) + ssum[i-1]);
	}
	used[x] = true; return memo[x] = res;
}
int main() {
	cin >> n >> v;
	v -= n;
	ll out = 0;
	rep(i, n) {
		cin >> c[i];
		out += c[i];
	}
	ll sum = 0; ld mi = mod; int chk = 1;
	rep(i, n) {
		sum += c[i];
		ssum[i] = sum;
		ld x = sum / (ld)(i + 1);
		if (x < mi) {
			mi = x; chk = i + 1;
		}
		d[i] = mi; e[i] = chk;
	}
	if (v - 20000 > 0) {
		ll vv = v - 20000;
		out += ssum[e[n - 1] - 1] * (vv / e[n - 1] + 1);
		v -= (vv / e[n - 1] + 1)*e[n-1];
	}
	memo[0] = 0; used[0] = true;
	dfs(v);
	out += memo[max((ll)0, v)];
	cout << out << endl;
	return 0;
}