#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void sort(int *x, size_t s);
void swap(int *x, int *y);

int main(void) {
    int N, K;
    int n[10] = {0};
    int sn = sizeof(n) / sizeof(n[0]);
    int *pn;
    pn = n;

    scanf("%d", &N);
    scanf("%d", &K);

    for (int i = 0; i < N; i++) {
        scanf("%d", &n[i]);
    }
    sort(pn, sn);
    
    printf("%d\n", n[N-1]-n[0]);

    return EXIT_SUCCESS;
}

void sort(int *x, size_t s) {
    for (int i = s; i > 1; i--) {
        for (int j = 1; j < i; j++) {
            if (*(x+j) == 0) {
                break;
            } else if (*(x+j-1) > *(x+j)) {
                swap(x+j-1, x+j);
            }
        }
    }
    return;
}

void swap(int *x, int *y) {
    int t;
    t = *x;
    *x = *y;
    *y = t;
    return;
}