#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <stack>
#include <utility>
#include <queue>
//#include <random>
#include <time.h>
#include <memory.h>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define SWAP(a,b) (a ^= b,b = a ^ b,a ^= b)
#define swap(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)

using namespace std;
typedef long long int lint;

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

int yuki0021()
{
	int N, K, tmp, min, max;
	cin >> N >> K;

	min = 1001; max = 0;
	for (int i = 0; i < N; i++) {
		cin >> tmp;
		if (tmp < min) 
			min = tmp;
		if (max < tmp)
			max = tmp;
	}
	
	cout << max - min << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0021();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}