#include<iostream>
#include<fstream>
#include<deque>
using namespace std;
int main() {
	int n, k, i, j,x,p,sum,min;
	int v[32000];
	ifstream f("deque.in");
	ofstream g("deque.out");
	f >> n >> k;
	for (i = 0;i < n;i++) {
		f >> x;
		v[i] = x;
	}
	cout << n << k;
	i = 0;
	sum = 0;
	j = k-1;
		while (j != n) {
			for (p = i;p <= j;p++) {
				if (p == i) {
					min = v[p];
				}
				else {
					if (min > v[p])
						min = v[p];
				}
			}
			j = j + 1;
			i = i + 1;
			sum = sum + min;
		}
		g << sum;
}