#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;

template<class T> inline void chmax(T& a, T b) { if(b > a) a = b; }

int main() {
	cin.tie(false);
	ios::sync_with_stdio(false);

	for(int n, k; cin >> n >> k, n | k;) {
		vector<int> c(n);
		for(int i = 0; i < n; ++i)
			cin >> c[i];

		int current = 0;
		for(int i = 0; i + k - 1 < n; ++i) {
			int ck = 0;
			for(int j = 0; j < k; ++j)
				ck += c[j];

			chmax(current, ck);
		}

		int change = 0;
		for(int i = 0; i < n; ++i) {
			for(int j = i + 1; j < n; ++j) {
				vector<int> tmp(c);
				swap(tmp[i], tmp[j]);
				for(int a = 0; a + k - 1 < n; ++a) {
					int ck = 0;
					for(int b = 0; b < k; ++b)
						ck += c[b];

					chmax(change, ck);
				}
			}
		}

		if(current > change)
			cout << "NO GAME" << endl;
		else
			cout << change - current << endl;
	}
	

	return EXIT_SUCCESS;
}