package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func main() {
	sc.Split(bufio.ScanWords)
	N, V := getInt(), getInt()
	b := make([]int, N+1)
	c := make([]int, N+1)
	for i := 1; i <= N; i++ {
		c[i] = getInt()
		b[i] = b[i-1] + c[i]
	}
	sum := b[N]
	if V <= N {
		out(sum)
		return
	}

	v := V - N
	x := 1
	for i := 2; i <= N; i++ {
		// out(b[i], x, b[x], i)
		if b[i]*x < b[x]*i {
			x = i
		}
	}

	var dp [21000]int
	// initialize
	for i := 0; i <= min(20200, v); i++ {
		dp[i] = math.MaxUint64 / 8
		if (v-i)%x == 0 {
			dp[i] = (v - i) / x * b[x]
		}
	}
	// dp
	for i := min(20200, V); i >= 0; i-- {
		for j := 0; j < N; j++ {
			dp[i] = min(dp[i], dp[i+j]+b[j])
		}
	}
	out(dp[0] + b[N])
}