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

int main()
{
    int N, K, num;
    vector<int> data;
    vector<double> ave;

    cin >> N >> K;
    for(int i=0; i<N; i++){
        cin >> num;
        data.push_back(num);
    }
    sort(data.begin(), data.end());
    cout << *(data.end() - 1) - *data.begin() << endl;


    return 0;
}