#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional> 
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <unordered_set>
#include <fstream>
#include <random>

using namespace std;

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

	int N, K, t;
	vector <int> v;

	cin >> N;
	cin >> K;
	for (int i = 0; i < N; i++)
	{
		cin >> t;
		v.push_back(t);
	}

	sort(v.begin(), v.end());

	int res = 0;

	for (int i = 0; i < N; i++)
	{
		for (int j = i + 1; j < N; j++)
		{
			int sum1 = 0;
			int sum2 = 0;
			int cnt1 = 0;
			int cnt2 = 0;
			for (int k = 0; k < N; k++)
			{
				if (k <= i)
				{
					sum1 += v[k];
					cnt1++;
				}
				else if (k >= j)
				{
					sum2 += v[k];
					cnt2++;
				}
			}
			double mean1 = sum1;
			double mean2 = sum2;
			mean1 /= cnt1;
			mean2 /= cnt2;
			int x = ceil(mean2 - mean1);
			//cout << mean1 << ' ' << mean2 << ' ' << x << '\n';
			res = max(res, x);
		}
	}

	cout << res << '\n';

	return 0;
}