import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


int N;
long V;
long[] C;

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		V = readLong;
		C = new long[N];
		foreach (i; 0 .. N) {
			C[i] = readLong;
		}
		
		long[] CSum = new long[N + 1];
		foreach (i; 0 .. N) {
			CSum[i + 1] = CSum[i] + C[i];
		}
		if (V < N) {
			writeln(CSum[N]);
			continue;
		}
		V -= N;
		
		long[] dp = new long[N^^2 + 1];
		dp[] = long.max;
		dp[0] = 0;
		foreach (k; 1 .. N + 1) {
			foreach (x; k .. N^^2 + 1) {	
				chmin(dp[x], dp[x - k] + CSum[k]);
			}
		}
debug{
writeln("dp : ",dp[0..min($,10)]);
}
		
		long sm = CSum[1];
		int km = 1;
		foreach (k; 1 .. N + 1) {
			if (sm * k > CSum[k] * km) {
				sm = CSum[k];
				km = k;
			}
		}
debug{
writeln("best : ",sm," / ",km);
}
		
		long ans = CSum[N];
		if (V <= N^^2) {
			ans += dp[cast(size_t)(V)];
		} else {
			long q = ((V - N^^2) + km - 1) / km;
			ans += q * sm;
			ans += dp[cast(size_t)(V - q * km)];
		}
		writeln(ans);
		
	}
	} catch (EOFException) {}
}