Problem C
Distributing Poffins

Poffins are one of the most delicious treats that Pokemon love to eat. You want to reward your $N$ Pokemon for their hard work in helping you become the Pokemon Champion, so you decide to buy $M$ poffins and you lay them in a pile for all the Pokemon to take. Each Pokemon takes some amount of poffins (potentially even no poffins) until no poffins remain in the pile. However, you notice that some Pokemon didn’t end up getting as many poffins as others, so you set out to distribute the poffins more fairly. You line up your Pokemon in a certain order and go through them one by one until you reach the end of the line, repeating a specific process for each Pokemon in order as follows:

1. If the current Pokemon doesn’t have a poffin, skip the following steps and move on to the next Pokemon in the line.

2. Take one poffin from the current Pokemon.

3. Give that poffin to the Pokemon with the least number of poffins (it might be the same Pokemon you took the poffin from). If there are multiple Pokemon with the least number of poffins, you may pick any of them to give the poffin to.

After completing this process, you notice that the Pokemon with the most amount of poffins has $P$ poffins and the Pokemon with the least poffins has $p$ poffins. What is the minimum value of $P-p$ over all possible ways the Pokemon initially took poffins?

For example, if you had $3$ Pokemon and bought $5$ poffins, one way to achieve the minimum value is if two of the three Pokemon took $1$ poffin and one took $3$ poffins initially. Then, after the redistribution process, $P$ would be $2$ and $p$ would be $1$, so $P-p=1$, which happens to be the minimum value across all initial distributions of poffins to Pokemon in this case.

Input

The input consists of one line containing integers $N$ and $M$. This denotes the number of Pokemon ($2 \leq N \leq 10^7$) and the total number of poffins ($1 \leq M \leq 10^9$)

Output

Output a single line containing the minimum value of $P-p$.

3 5

1

3 6

0