B'Polycarp started working at a bank. He was assigned to monitor the ATM. The ATM initially contains s rubles. A queue of n students lined up to him. Each student wants to either withdraw a certain amount of money or deposit it into an account. If a_i is positive, then the student credits that amount of money via ATM. Otherwise, the student withdraws |a_i| rubles. In the beginning, the ATM is turned off and an arbitrary number of students are not served. At some point, Polycarp turns on the ATM, which has an initial amount of s rubles. Then, the remaining students start queueing at the ATM. If at some point in time there is less money in the ATM than the student wants to withdraw, then the student is not served and Polycarp turns off the ATM and does not turn it on anymore. More formally, the students that are served are forming a contiguous subsequence. Polycarp wants the ATM to serve the maximum number of students. Help him in this matter. Print the numbers of the first and last student, or determine that he will not be able to serve anyone. In other words, find such a longest continuous segment of students that, starting with the sum of s at the ATM, all these students will be served. ATM serves students consistently (i.e. one after another in the order of the queue). The first line of the input contains one integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Each test case consists of two lines. The first one contains integers n and s ( 1 <= n <= 2 cdot10^5 ; 0 <= s <= 10^9 ) -- the length of the a array and the initial amount of rubles in the ATM. The second contains n integers a_1, a_2, ... , a_n ( -10^9 <= a_i <= 10^9 ) -- elements of the a array. Note that a_i can be zero. It is guaranteed that the sum of the values n over all test cases does not exceed 2 cdot10^5 . Print t lines, each line must contain the answer to'...