B"You are given an integer array a_1, a_2, ... , a_n and integer k . In one step you can What is the minimum number of steps you need to make the sum of array sum limits_{i=1}^{n}{a_i} <= k ? (You are allowed to make values of array negative). The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains two integers n and k ( 1 <= n <= 2 cdot 10^5 ; 1 <= k <= 10^{15} ) -- the size of array a and upper bound on its sum. The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ) -- the array itself. It's guaranteed that the sum of n over all test cases doesn't exceed 2 cdot 10^5 . For each test case, print one integer -- the minimum number of steps to make sum limits_{i=1}^{n}{a_i} <= k . In the first test case, you should decrease a_1 10 times to get the sum lower or equal to k = 10 . In the second test case, the sum of array a is already less or equal to 69 , so you don't need to change it. In the third test case, you can, for example: In the fourth test case, you can, for example: "...