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

using namespace std;

int main() {
    int n, k;
    vector<int> v;
    
    cin >> n >> k >> std::ws;
    
    int tmp;
    for (int i = 0; i < n; i++) {
        cin >> tmp;
        v.push_back(tmp);
    }
    
    int ans = *std::max_element(v.begin(), v.end()) - *std::min_element(v.begin(), v.end());
    
    cout << ans << endl;
    
    return 0;
}