n,m = [int(_) for _ in input().split()]
pole = [int(_) for _ in input().split()]
maxim = 0
for i in range(0,n-2):
	for j in range(i+1+m,n-1):
		for k in range(j+1+m, n):
			if (pole[i]+pole[j]+pole[k] > maxim):
				maxim = pole[i]+pole[j]+pole[k]
print(maxim)
 
maxim = 0
for j in range(1+m,n-1-m):
	b = pole[j]
	a = pole[0]
	for i in range(1, j-m):
		if (pole[i] > a):
			a = pole[i]
	c = pole[n-1]		
	for k in range(j+m+1, n-1):
		if (pole[k] > c):
			c = pole[k]
	if (a+b+c > maxim):
		maxim = a+b+c
print(maxim)
 

bixtID0gW2ludChfKSBmb3IgXyBpbiBpbnB1dCgpLnNwbGl0KCldCnBvbGUgPSBbaW50KF8pIGZvciBfIGluIGlucHV0KCkuc3BsaXQoKV0KbWF4aW0gPSAwCmZvciBpIGluIHJhbmdlKDAsbi0yKToKCWZvciBqIGluIHJhbmdlKGkrMSttLG4tMSk6CgkJZm9yIGsgaW4gcmFuZ2UoaisxK20sIG4pOgoJCQlpZiAocG9sZVtpXStwb2xlW2pdK3BvbGVba10gPiBtYXhpbSk6CgkJCQltYXhpbSA9IHBvbGVbaV0rcG9sZVtqXStwb2xlW2tdCnByaW50KG1heGltKQoKbWF4aW0gPSAwCmZvciBqIGluIHJhbmdlKDErbSxuLTEtbSk6CgliID0gcG9sZVtqXQoJYSA9IHBvbGVbMF0KCWZvciBpIGluIHJhbmdlKDEsIGotbSk6CgkJaWYgKHBvbGVbaV0gPiBhKToKCQkJYSA9IHBvbGVbaV0KCWMgPSBwb2xlW24tMV0JCQoJZm9yIGsgaW4gcmFuZ2UoaittKzEsIG4tMSk6CgkJaWYgKHBvbGVba10gPiBjKToKCQkJYyA9IHBvbGVba10KCWlmIChhK2IrYyA+IG1heGltKToKCQltYXhpbSA9IGErYitjCnByaW50KG1heGltKQo=

MTAgMQo0IDEgNyA4IDMgNiAxMCAxMCA3IDMKOCAyCjQgMiAzIDggMSA1IDQgMg==

10 1
4 1 7 8 3 6 10 10 7 3
8 2
4 2 3 8 1 5 4 2