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

const int kMAX_N = 10;

int N, K;
vector<int> n;

void Solve() {
    sort(n.begin(), n.end());
    cout << n[N -  1] - n[0] << endl;
}

int main() {
    cin >> N >> K;
    
    n = vector<int>(N);
    for (int i = 0; i < N; i++) {
        cin >> n[i];
    }

    Solve();

    return 0;
}