#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define ll long long

int N, V, C[111];
ll sum[111], dp[11111];

ll solve(void){
  int i, k, opt;

  V = max(0, V-N);
  sum[0] = 0;
  rep(i,N) sum[i+1] = sum[i] + C[i];

  dp[0] = 0;
  REP(i,1,11111) dp[i] = dp[i-1] + sum[1];
  REP(k,2,N+1) REP(i,k,11111) dp[i] = min(dp[i], dp[i-k]+sum[k]);

  opt = 1;
  REP(i,2,N+1){
    if(sum[opt] * i > sum[i] * opt) opt = i;
  }

  k = max(0, (V-11000) / opt);
  return k * sum[opt] + dp[V - k*opt] + sum[N];
}

int main(){
  int i;
  ll res;

  scanf("%d%d",&N,&V);
  rep(i,N) scanf("%d",C+i);

  res = solve();
  printf("%lld\n",res);

  return 0;
}