CF1279B.Verse For Santa

New Year is coming! Vasya has prepared a New Year's verse and wants to recite it in front of Santa Claus.

Vasya's verse contains $n$ parts. It takes $a_i$ seconds to recite the $i$-th part. Vasya can't change the order of parts in the verse: firstly he recites the part which takes $a_1$ seconds, secondly — the part which takes $a_2$ seconds, and so on. After reciting the verse, Vasya will get the number of presents equal to the number of parts he fully recited.

Vasya can skip at most one part of the verse while reciting it (if he skips more than one part, then Santa will definitely notice it).

Santa will listen to Vasya's verse for no more than $s$ seconds. For example, if $s = 10$, $a = [100, 9, 1, 1]$, and Vasya skips the first part of verse, then he gets two presents.

Note that it is possible to recite the whole verse (if there is enough time).

Determine which part Vasya needs to skip to obtain the maximum possible number of gifts. If Vasya shouldn't skip anything, print 0. If there are multiple answers, print any of them.

You have to process $t$ test cases.

新年即将到来！瓦西娅准备了一首新年诗歌，打算在圣诞老人面前朗诵。

瓦西娅的诗歌包含 $n$ 个部分。朗诵第 $i$ 个部分需要 $a_i$ 秒。瓦西娅不能改变诗歌各部分的顺序：他首先朗诵耗时 $a_1$ 秒的部分，其次朗诵耗时 $a_2$ 秒的部分，依此类推。朗诵完诗歌后，瓦西娅获得的礼物数量等于他完整朗诵的部分数。

在朗诵过程中，瓦西娅最多可以跳过诗歌中的一个部分（若跳过超过一个部分，则圣诞老人一定会察觉）。

圣诞老人最多只会听瓦西娅朗诵 $s$ 秒。例如，若 $s = 10$，$a = [100, 9, 1, 1]$，且瓦西娅跳过了诗歌的第一个部分，则他可获得两份礼物。

注意：若时间充足，瓦西娅也可以选择不跳过任何部分，完整朗诵整首诗歌。

请确定瓦西娅应跳过哪一部分，才能获得最多的礼物。若不应跳过任何部分，请输出 0；若存在多种可行方案，输出任意一种即可。

你需要处理 $t$ 组测试用例。

The first line contains one integer $t$ ($1 \le t \le 100$) — the number of test cases.

The first line of each test case contains two integers $n$ and $s$ ($1 \le n \le 10^5, 1 \le s \le 10^9$) — the number of parts in the verse and the maximum number of seconds Santa will listen to Vasya, respectively.

The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$) — the time it takes to recite each part of the verse.

It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.

第一行包含一个整数 $t$（$1 \le t \le 100$）——测试用例的数量。

每个测试用例的第一行包含两个整数 $n$ 和 $s$（$1 \le n \le 10^5$，$1 \le s \le 10^9$）——分别为诗句的段落数和圣诞老人愿意听 Vasya 表演的最长时间（单位：秒）。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^9$）——分别为朗诵诗句各段所需的时间。

保证所有测试用例的 $n$ 值之和不超过 $10^5$。

For each test case print one integer — the number of the part that Vasya needs to skip to obtain the maximum number of gifts. If Vasya shouldn't skip any parts, print 0.

对于每个测试用例，输出一个整数——即瓦西娅需要跳过的部分的编号，以获得最多的礼物数量。如果瓦西娅不应跳过任何部分，则输出 0。

In the first test case if Vasya skips the second part then he gets three gifts.

In the second test case no matter what part of the verse Vasya skips.

In the third test case Vasya can recite the whole verse.

在第一个测试用例中，如果瓦西娅跳过第二部分，他将获得三份礼物。

在第二个测试用例中，无论瓦西娅跳过诗的哪一部分。

在第三个测试用例中，瓦西娅可以完整地朗诵整首诗。