//vanitas vanitatum et omnia #include #define fi first #define se second #define eb emplace_back #define mp make_pair using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef __int128 i128; template T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);} template T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);} template bool chmax(T &a,const S b) {return (a bool chmin(T &a,const S b) {return (a>b?a=b,1:0);} int popcnt(int x) {return __builtin_popcount(x);} int popcnt(ll x) {return __builtin_popcountll(x);} int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));} int topbit(ll x) {return (x==0?-1:63-__builtin_clzll(x));} int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));} int lowbit(ll x) {return (x==0?-1:__builtin_ctzll(x));} #define int long long #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) typedef pair pii; typedef vector vi; typedef vector vp; typedef tuple tiii; int read() { int x=0,w=1; char c=getchar(); while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();} while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} return x*w; } const int N=105,inf=0x3f3f3f3f3f3f3f3f; int n,a[N],V,f[N*N],ans; signed main() { n=read(), V=read(); rep(i,1,n) a[i]=read(), ans+=a[i], V--; if(V<=0) return printf("%lld\n",ans), 0; rep(i,1,n) a[i]+=a[i-1]; memset(f,0x3f,sizeof(f)); f[0]=0; rep(i,1,n) { rep(j,i,n*n) chmin(f[j],f[j-i]+a[i]); } int rc=1, rs=a[1], res=inf; rep(i,1,n) if(a[i]*rc