Pirates and Coins#75

Pirates and Coins

1 second

128 megabytes

Very easy

$n$ pirates divided a treasure of $m$ gold coins fairly: each pirate received their share according to rank and seniority. The youngest pirate took $a$ coins, and each subsequent pirate took one more coin than the previous pirate. The last pirate was the captain, who received twice as many coins as was initially planned for him. After the captain, there were no coins left.

Input

The input contains two integers $a$ and $m$ ( $1 \leq a \leq 100$ 1 \leq a \leq 100, $m < 15150$ m < 15150).All input data are valid.

Output

Output the number of pirates $n$ .

Examples

Example 1

Loading

1 \leq a \leq 100

m < 15150