#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;	

ll n, v;
ll c[110];
//tie(pri, sum, cnt) pri = sum / cnt, sum := cntリットルの値段 
vector<tuple<double, ll, ll>> s;
//dp[i][j] := sのi番目まで使って、合計リットルをjにするときの最小の値段
ll dp[110][11010];
int main(void){
	cin >> n >> v;
	v -= n; //すべてを1Lずつつかう
	rep(i, n) cin >> c[i];
	ll sum = 0;
	rep(i, n){
		sum += c[i];
		int cnt = i + 1;
		s.pb(make_tuple((double)sum / cnt, sum, cnt));
	}
	sort(all(s));

	ll ans = sum; 
	/*
	rep(i, n){
		if(v <= n * n) break;
		double pri; ll sum, cnt;
		tie(pri, sum, cnt) = s[i];
		// printf("%f %lld %lld\n", pri, sum, cnt);
		if(v - (v / cnt) * cnt >= 0){
			v -= (v / cnt) * cnt;
			ans += sum * (v / cnt);
		}
	}
	*/

	if(v < 0){
		printf("%lld\n", ans);
		return 0;
	}
	// printf("%lld %lld\n", v, ans);

	{
		double pri; ll sum, cnt;
		tie(pri, sum, cnt) = s[0];
		// printf("yy\n");
		//cnt　L で　sum 円
		ll pack = v / cnt;
		if(v - pack * cnt >= 0){
			// printf("k\n");
			v -= pack * cnt;
			ans += sum * pack;
		}
	}

	// printf("%lld %lld\n", v, ans);
	// printf("%lld v %lld\n", ans, v);

	rep(i, 110)rep(j, 11010) dp[i][j] = INFF;
	dp[0][0] = 0;
	rep(i, n)rep(j, n * n)rep(k, n * n){
		if(dp[i][j] == INFF) continue;
		double pri; ll sum, cnt;
		tie(pri, sum, cnt) = s[i];
		int d = j + cnt * k; // cnt　リットルのものを k 個買う
		if(d <= n * n){
			chmin(dp[i + 1][d], dp[i][j] + sum * k);
			// printf("dp[%d][%d]=%lld dp[%d][%d]=%lld\n", i+1,d,dp[i + 1][d],i,j,dp[i][j] + sum * k);
		}
	}
	ll tmp;
	reps(i, v, 11010) chmin(tmp, dp[n][i]);
	printf("%lld\n", ans + tmp);
	return 0;
}