#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

const int maxn=+;

typedef long long ll;

int a[maxn];

int n,k;

int checkmi(int x)

{

    ll sum=;

    for(int i=;i<n;i++)

    {

        if(a[i]>x) break;

        sum+=x-a[i];

    }

    if(sum<=k) return ;

    else return ;

}

bool checkma(int x)

{

    ll sum=;

    for(int i=n-;i>=;i--)

    {

        if(a[i]<x) break;

        sum+=a[i]-x;

    }

    if(sum<=k) return ;

    else return ;

}

int main()

{

    while(scanf("%d%d",&n,&k)!=EOF)

    {

        ll sum=;

        for(int i=;i<n;i++)

            {scanf("%d",&a[i]);

             sum+=a[i];}

        sort(a,a+n);

        int al,ar;

        if(sum%n==) {al=sum/n,ar=sum/n;}

        else {al=sum/n,ar=sum/n+;}

        int l=a[],r=al;

        int ansl=a[],ansr=a[];

        while(l<=r)

        {

            int mid=(l+r)>>;

            if(checkmi(mid))

            {

                 ansl=mid;

                l=mid+;

            }

            else r=mid-;

        }

        l=ar,r=a[n-];

        while(l<=r)

        {

            int mid=(l+r)>>;

            if(checkma(mid))

            {

                ansr=mid;

                r=mid-;

            }

            else l=mid+;

        }

        printf("%d\n",ansr-ansl);

    }

    return ;

}