#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
#define ull unsigned ll

ll read_int(ll mn, ll mx, char next){
  ll c, fg = 1, res = 0;
  c=getchar();
  if(c=='-') fg = -1, c = getchar();
  assert('0'<=c && c<='9');
  res = c - '0';
  for(;;){
    c = getchar();
    if(c==next) break;
    assert(res!=0);
    assert('0'<=c && c<='9');
    res = res * 10 + (c - '0');
  }
  res *= fg;
  assert(mn<=res && res<=mx);
  return res;
}

#define N_MAX 100
#define V_MAX 1000000000
#define C_MAX 1000000000

int N, V, C[1111];

int VV;
ll sum[111];

ll solve(void){
  int i, j, k, opt;
  ll res, tmp;
  static ll dp[11111];

  VV = 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;
  }

  res = 0;
  k = max(0, (VV-11111) / opt);
  res += k * sum[opt];
  VV -= k * opt;
  while(VV >= 11111) VV -= opt, res += sum[opt];

  res += dp[VV];
  res += sum[N];
  return res;
}

int main(){
  int i, j, k;
  ll res;

  N = read_int(1, N_MAX, ' ');
  V = read_int(1, V_MAX, '\n');
  rep(i,N) C[i] = read_int(1, C_MAX, i==N-1?'\n':' ');
  
  res = solve();
  printf("%lld\n",res);

  {char c; assert(scanf("%c",&c)!=1);}

  return 0;
}