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

int main()
{
	int N, K; vector<int> n;
	
	cin >> N >> K;
	for (int i = 0; i < N; ++i)
	{
		int j;
		cin >> j;
		n.push_back(j);
	}

	cout << ceil(*max_element(n.begin(), n.end()) - *min_element(n.begin(), n.end())) << endl;

	return 0;
}