#include <iostream>
#include <cmath>
#include <climits>
#define ll long long
 
using namespace std;
int main() {
	int n,k; cin>>n>>k;
	int* arr = new int[n+1]();
	for(int i =1; i<=n; ++i) cin>>arr[i];
	ll* f = new ll[n+1]();
	ll* b = new ll[n+1]();
 
	if(k+1 <=n && k+2 <= n) { 	f[k+1] = arr[k+1]; f[k+2] = arr[k+2];   }
	else if(k+1 <= n ) f[k+1] = arr[k+1];
 
	for(int i = k+ 3; i<=n; ++i) 
	f[i] = max(f[i-1],f[i-2]) + arr[i];
 
	b[1] = arr[1]; b[2] = arr[1] + arr[2];
	for(int i = 3; i <= n; ++i) 
	  b[i] = max(b[i-1],b[i-2]) + arr[i];
 
	ll ans = INT_MIN;
	for(int i =k; i<=n ;++i) 
	ans = max(ans, f[i] + b[i] - arr[i]);
 
	cout<<ans;
 
} 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CiNpbmNsdWRlIDxjbGltaXRzPgojZGVmaW5lIGxsIGxvbmcgbG9uZwoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKSB7CglpbnQgbixrOyBjaW4+Pm4+Pms7CglpbnQqIGFyciA9IG5ldyBpbnRbbisxXSgpOwoJZm9yKGludCBpID0xOyBpPD1uOyArK2kpIGNpbj4+YXJyW2ldOwoJbGwqIGYgPSBuZXcgbGxbbisxXSgpOwoJbGwqIGIgPSBuZXcgbGxbbisxXSgpOwoJCglpZihrKzEgPD1uICYmIGsrMiA8PSBuKSB7IAlmW2srMV0gPSBhcnJbaysxXTsgZltrKzJdID0gYXJyW2srMl07ICAgfQoJZWxzZSBpZihrKzEgPD0gbiApIGZbaysxXSA9IGFycltrKzFdOwoJCglmb3IoaW50IGkgPSBrKyAzOyBpPD1uOyArK2kpIAoJZltpXSA9IG1heChmW2ktMV0sZltpLTJdKSArIGFycltpXTsKCQoJYlsxXSA9IGFyclsxXTsgYlsyXSA9IGFyclsxXSArIGFyclsyXTsKCWZvcihpbnQgaSA9IDM7IGkgPD0gbjsgKytpKSAKCSAgYltpXSA9IG1heChiW2ktMV0sYltpLTJdKSArIGFycltpXTsKCQoJbGwgYW5zID0gSU5UX01JTjsKCWZvcihpbnQgaSA9azsgaTw9biA7KytpKSAKCWFucyA9IG1heChhbnMsIGZbaV0gKyBiW2ldIC0gYXJyW2ldKTsKCQoJY291dDw8YW5zOwoJCn0g