import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 18446744073709551615
# inf = 4294967295
# md = 10**9+7
# md = 998244353

n, V = LI()
cc = LI()
ss = [0]
for c in cc: ss.append(ss[-1]+c)

if V <= n:
    print(ss[-1])
    exit()

ans = ss[-1]
V -= n

mns, mnv = inf, 1
for v, s in enumerate(ss[1:], 1):
    if s*mnv < mns*v: mns, mnv = s, v
# pDB(mns, mnv)

if V > 10000:
    k = (V-10000)//mnv
    V -= mnv*k
    ans += mns*k

dp = [inf]*(V+1)
dp[0] = 0
for i in range(V):
    for v, s in enumerate(ss[1:], 1):
        j = i+v
        if j > V: j = V
        if dp[j] > dp[i]+s: dp[j] = dp[i]+s

print(ans+dp[-1])