//#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef signed long long ll; #define pp(...) (void)printf(__VA_ARGS__) #define For(x,to) for(x=0;x<(to);x++) #define ForAuto(x,arr) for(auto& x:arr) #define ForBeginEnd(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define All(a) (a.begin()),(a.end()) #define Zeros(a) memset(a,0,sizeof(a)) #define Minus(a) memset(a,0xff,sizeof(a)) #define PI 3.14159265 #define EPS (1e-10) #define EPS_eq(a,b) (abs((a)-(b)) < EPS) #pragma GCC diagnostic ignored "-Wconversion" //#define int long long //#define INF 1000*1000 int dxy[] = {0, 1, 0, -1, 0}; typedef pair P; void pp_int(int x){ printf("%d\n", x); }; int i,j,k; ll M = 100000009; //ios::sync_with_stdio(false); //------------------------------------------------- ll INF = 1000000000000000; ll C[300]; ll SUM[300]; ll dp[20500]; signed main() { ll N,V; cin>>N>>V; for(int i=1;i<=N;i++){ cin>>C[i]; SUM[i] = SUM[i-1] + C[i]; } if(V<=N){ cout<SUM[i]*x){ x=i; } } for(ll i=0;i<20500;i++){ if((V-i)%x==0){ dp[i] = (V-i)/x*SUM[x]; }else{ dp[i] = INF; } } for(int i=20000;i>=0;i--){ for(int j=1;j<=N;j++){ dp[i] = min(dp[i], dp[i + j] + SUM[j]); } } cout<