Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Robin Hood

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputWe 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 *c*_{i} 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* ≤ 10^{9}) — 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 *c*_{i} (1 ≤ *c*_{i} ≤ 10^{9}) — 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, 4, 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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/25/2017 03:01:51 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|