There is destruction everywhere in Haryana.
A person participating in the protest can destroy maximum K items.
There are N shops on highway and the person may start from any shop and keep moving only right, continuously destroying other shops.
Each shop has a certain number of items and the person destroys all the items in the shop he arrives. However the person wants
to attack the maximum number of shops, So help him deciding from which shop to start the destruction.
Input:
You will receive one integer T denoting the number of test cases.
Each test case will contain two integers N,K separated by a space denoting the number of shops and the maximum items the person can destroy. After that, the next line will contain N integers separated by a single space where the ith integer denotes the number of items in Shopi.
Output:
Your output should consist of T pair of number each in a new line denoting the number of items the person destroys and the number of shops he attacks.
Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 105, 1 ≤ K ≤ 107
items in a shop ≤ 109
sum of all N over T ≤ 106
Note:
If maximum number of shops can be attacked in multiple ways you have to output the case in which the minimum number of items are destroyed.
First Test Case:
The person starts the destruction at shop 1 (with 20 items) and goes to shop 2, then to the shop 3, at this point, he has destroyed 65 items, if he decides to go to shop 4 he will have to destroy 145 in total which is more than the maximum allowed hence he stops the rampage.
The person, however may start at shop 2 with 15 items, but then he would be able to go maximum till shop 3 hence starting at shop 1 would be better.
Second Test Case:
its clear that the maximum number of shops we can attack is 3. But there are two ways of doing so.
1 2 3 (items destroyed 1+2+3 = 6)
2 3 4 (items destroyed 2+3+4 = 9)
We will output the first possibility in the above case.
