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

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)

using namespace std;

typedef long long int lli;

int main() {
    int N;
    int K;
    cin >> N >> K;
    vector<int> n(N);
    REP (i, 0, N) cin >> n[i];
    int m = 1e+5;
    int M = 0;
    REP (i, 0, N) {
        m = min(m, n[i]);
        M = max(M, n[i]);
    }
    cout << M - m << endl;
    return 0;
}