671B（正常模拟，思维）

We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.

There are n citizens in Kekoland, each person has ci coins. Each day, Robin Hood will take exactly 1 coin from the richest person in the city and he will give it to the poorest person (poorest person right after taking richest's 1 coin). In case the choice is not unique, he will select one among them at random. Sadly, Robin Hood is old and want to retire in k days. He decided to spend these last days with helping poor people.

After taking his money are taken by Robin Hood richest person may become poorest person as well, and it might even happen that Robin Hood will give his money back. For example if all people have same number of coins, then next day they will have same number of coins too.

Your task is to find the difference between richest and poorest persons wealth after k days. Note that the choosing at random among richest and poorest doesn't affect the answer.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 500 000, 0 ≤ k ≤ 109) — the number of citizens in Kekoland and the number of days left till Robin Hood's retirement.

The second line contains n integers, the i-th of them is ci (1 ≤ ci ≤ 109) — initial wealth of the i-th person.

Output

Print a single line containing the difference between richest and poorest peoples wealth.

Examples

input

4 1
1 1 4 2

output

2

input

3 1
2 2 2

output

0

Note

Lets look at how wealth changes through day in the first sample.

1. [1, 1, 4, 2]
2. [2, 1, 3, 2] or [1, 2, 3, 2]

So the answer is 3 - 1 = 2

In second sample wealth will remain the same for each person.

题意：英雄喜欢从最富的手里抢一块钱给最穷的，只剩下k天了，问k天过后，最富的和最穷的差多少。

思路：

首先排序，两次for循环遍历，也就是假设样例是7 5    1 2 3 4 5 6 7（这是排序后的结果），首先第一次最左边加一，变成2 2 3 4 5 6 7，第二次任意选一个最小的，变成2 3 3 4 5 6 7，第三次3 3 3 4 5 6 7，第四次3 3 4 4 5 6 7

第五次3 4 4 4 5 6 7，就这样k天没了，但是既然从小都减少了，那么右边也要开始减少，最终结果是3 4 4 4 4 4 5，所以得出2.大致思路就是这样。

代码范例：

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<set>
using namespace std;
#define INF 1.0e14;
const int N = 1e6+10;
typedef long long LL;
LL a[N],r[N],l[N];
int main()
{
    LL n,m,sum=0;
    scanf("%I64d%I64d",&n,&m);
    for(int i=1; i<=n; i++)
        scanf("%I64d",&a[i]),sum+=a[i];
    sort(a+1,a+n+1);
    int i,j;
    LL val=0;
    for(i=2; i<=n; i++)
    {
        if(val+(a[i]-a[i-1])*(i-1)>m)
            break;
        val+=(a[i]-a[i-1])*(i-1);
    }
    LL dis=0;
    for(j=n-1; j>=1; j--)
    {
        if(dis+(a[j+1]-a[j])*(n-j)>m)
            break;
        dis+=(a[j+1]-a[j])*(n-j);
    }
    if(i-j>1)
    {
        if(sum%n)
            printf("1\n");
        else
            printf("0\n");
    }
    else
    {
        val=((m-val)/(i-1))+a[i-1];
        dis=a[j+1]-(m-dis)/(n-j);
        LL t=sum%n?1:0;
        printf("%I64d\n",max(dis-val,t));//没这个，数据  3 4      1 2 7 是不能过的。
        //自己想一下，很好相通的
    }
}