#include <iostream>
using namespace std;

const int maxn = 10002, maxm =101, inf = 100000000;
int f[maxn][maxm], c[maxn];

int main(){
	int n, m;
	scanf("%d%d",&n,&m);
	for (int i = 0; i < n; ++i)
	  scanf("%d",&c[i]);
	memset(f, 120, sizeof(f));
	for (int i = 0; i < m; ++i)
		for (int j = i+1; j < m; ++j)
			f[i][j] = c[i];
	for (int i = 1; i < n; ++i)
		for (int j = 1; j < m && j<=i; ++j)
			f[i][j] = min(f[i][j-1], f[i-j][m-j]+c[i]);

	int ans = inf;
	for (int i = n; i < n+m; ++i)
		for (int j = 1; j < m; ++j)
			if (i-j<n) 
				ans = min(f[i-j][m-j], ans);
	cout << ans;
	return 0;
}