#include<cstdio>
using namespace std;
int max(int a[]){
    int M=0;
    int *p = a;
    while(*p != 0){
        if(*p > M) M = *p;
        p++;
    }
    return M;
}
int min(int a[]){
    int m=1000000;
    int *p = a;
    while(*p != 0){
        if(*p < m) m = *p;
        p++;
    }
    return m;
}
int main(){
    int N,K;
    int array[9];
    int i;
    int M,m;
    scanf("%d %d",&N,&K);
    for(i = 0;i < N;i++){
        scanf("%d",&array[i]);
    }
    M = max(array);
    m = min(array);
    printf("%d\n",M-m);
    return 0;
}