CF92A Chips

There are $ n $ walruses sitting in a circle. All of them are numbered in the clockwise order: the walrus number $ 2 $ sits to the left of the walrus number $ 1 $ , the walrus number $ 3 $ sits to the left of the walrus number $ 2 $ , ..., the walrus number $ 1 $ sits to the left of the walrus number $ n $ . The presenter has $ m $ chips. The presenter stands in the middle of the circle and starts giving the chips to the walruses starting from walrus number $ 1 $ and moving clockwise. The walrus number $ i $ gets $ i $ chips. If the presenter can't give the current walrus the required number of chips, then the presenter takes the remaining chips and the process ends. Determine by the given $ n $ and $ m $ how many chips the presenter will get in the end.

The first line contains two integers $ n $ and $ m $ ( $ 1

Print the number of chips the presenter ended up with.

In the first sample the presenter gives one chip to the walrus number $ 1 $ , two chips to the walrus number $ 2 $ , three chips to the walrus number $ 3 $ , four chips to the walrus number $ 4 $ , then again one chip to the walrus number $ 1 $ . After that the presenter runs out of chips. He can't give anything to the walrus number $ 2 $ and the process finishes. In the third sample the presenter gives one chip to the walrus number $ 1 $ , two chips to the walrus number $ 2 $ , three chips to the walrus number $ 3 $ , then again one chip to the walrus number $ 1 $ . The presenter has one chip left and he can't give two chips to the walrus number $ 2 $ , that's why the presenter takes the last chip.