import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, std.bitmanip;

immutable long INF = 1L << 50;

void main() {
    auto s = readln.split.map!(to!int);
    auto N = s[0];
    auto V = s[1];
    auto C = readln.split.map!(to!long).array;

    if (N >= V) {
        C.sum.writeln;
        return;
    }

    long ans = C.sum;
    V -= N;

    auto P = new Tuple!(int, long)[](N);
    long c = C.sum;
    
    foreach_reverse (i; 0..N) {
        P[i] = tuple(i+1, c);
        c -= C[i];
    }

    P.sort!"a[1]*b[0] < a[0]*b[1]";
    ans += P[0][1] * (V / P[0][0]);
    V %= P[0][0];


    auto dp = new long[][](N+1, V+200);
    foreach (i; 0..N+1) fill(dp[i], INF);
    dp[0][0] = 0;

    foreach (i; 0..N) {
        foreach (j; 0..V+200) {
            dp[i+1][j] = dp[i][j];
        }
        int v = P[i][0];
        long cost = P[i][1];
        foreach (j; 0..V+200-v) {
            dp[i+1][j+v] = min(dp[i+1][j+v], dp[i][j] + cost);
        }
    }

    ans += dp[N][V..V+200].reduce!min;
    ans.writeln;
}