N, V = gets.split.take(2).map(&:to_i)
C = gets.split.take(N).map(&:to_i)

v = V - N
res = C.sum
if v < 1
  p res
  exit
end
I = (0...N).min_by{|i| C[0..i].sum./i+1 }
mul, v = v.divmod(I + 1)
res += C[0..I].sum * mul

$dp = {}
def f(v, i, limit)
  $dp[[v,i]] ||= if v <= 0
    0
  elsif i >= I
    9e99
  else
    (1..limit).map{|lim|
      C[i]*lim + f(v - lim, i + 1, limit - lim)
    }.min
  end
end

p f(v, 0, v) + res