#include <iostream>
using namespace std;

int main(void){
    int N, K, i, *p;
    
    cin >> N >> K;
    p = (int*)calloc(N, sizeof(int));
    for(i=0; i<N; i++) cin >> p[i];
    qsort(p, N, sizeof(int), [](const void *a, const void *b){return *(int*)a - *(int*)b;});
    cout << *(p+N-1) - *p << endl;

    free(p);
    return 0;
}