#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(int argc, char const *argv[])
{
    int N;
    int K;
    vector<int> v;

    cin >> N >> K;

    int i;
    int tmp;
    for(i = 0; i < N; i++){
        cin >> tmp;
        v.push_back(tmp);
    }

    sort(v.begin(), v.end());

    cout << v.back() - v.front() << endl;

    return 0;
}