/* -*- coding: utf-8 -*-
 *
 * 31.cc: No.31 悪のミックスジュース - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;

typedef long long ll;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

struct CSum {
  int i, k;
  ll sum;
  double ave;
  CSum() {}
  CSum(int _i, int _k, ll _sum): i(_i), k(_k), sum(_sum) {
    ave = (double)sum / k;
  }
  bool operator<(const CSum &c) const { return ave < c.ave; }
  void print() { printf("%d,%d,%lld,%lf\n", i, k, sum, ave); }
};

/* global variables */

int n, cs[MAX_N];
CSum csums[MAX_N];

/* subroutines */

void rec(int i, int v, ll total) {
  //printf("rec(%d, %d, %lld)\n", i, v, total);

  if (v == 0) {
    printf("%lld\n", total);
    exit(0);
  }
  if (i >= n) return;

  for (int j = v / csums[i].k; j >= 0; j--)
    rec(i + 1, v - j * csums[i].k, total + csums[i].sum * j);
}

/* main */

int main() {
  ll v;
  cin >> n >> v;
  for (int i = 0; i < n; i++) cin >> cs[i];

  csums[0] = CSum(0, 1, cs[0]);
  for (int i = 1; i < n; i++)
    csums[i] = CSum(i, i + 1, csums[i - 1].sum + cs[i]);
  ll total = csums[n - 1].sum;
  sort(csums, csums + n);
  //for (int i = 0; i < n; i++) csums[i].print();

  if (v < n)
    printf("%lld\n", total);
  else 
    rec(0, v - n, total);
  return 0;
}