#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int N, K;
int n[10];

int main()
{
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		cin >> n[i];
	}
	sort(n,n+N);
	cout << n[N - 1] - n[0] << endl;
	return 0;
}