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

int main() {
    int n, k;
    cin >> n >> k;
    int ns[n];
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        ns[i] = x;
    }
    cout << *max_element(ns,ns+n) - *min_element(ns,ns+n) << endl;
    return 0;
}