#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

void solve();
int main() {
	solve();
#ifdef DBG
	while (true);
#endif
}
//21
void solve() {
	int n, k, A, s = 1000, b = 1;
	scanf("%d %d", &n, &k);
	for (int i = 0; i < n; i++)
		scanf("%d", &A), s = min(s, A), b = max(b, A);
	printf("%d\n", b - s);
}