CF1822A.TubeTube Feed

Mushroom Filippov cooked himself a meal and while having his lunch, he decided to watch a video on TubeTube. He can not spend more than $t$ seconds for lunch, so he asks you for help with the selection of video.

The TubeTube feed is a list of $n$ videos, indexed from $1$ to $n$. The $i$-th video lasts $a_i$ seconds and has an entertainment value $b_i$. Initially, the feed is opened on the first video, and Mushroom can skip to the next video in $1$ second (if the next video exists). Mushroom can skip videos any number of times (including zero).

Help Mushroom choose one video that he can open and watch in $t$ seconds. If there are several of them, he wants to choose the most entertaining one. Print the index of any appropriate video, or $-1$ if there is no such.

蘑菇·菲利波夫为自己做了一顿饭，吃饭时他决定在 TubeTube 上看一个视频。他午餐时间不能超过 $t$ 秒，因此他请你帮忙挑选合适的视频。

TubeTube 的信息流是一个包含 $n$ 个视频的列表，编号从 $1$ 到 $n$。第 $i$ 个视频时长为 $a_i$ 秒，娱乐值为 $b_i$。初始时信息流打开在第一个视频上，蘑菇可以在 $1$ 秒内跳转到下一个视频（如果下一个视频存在）。蘑菇可以跳过任意数量的视频（包括零次）。

请帮助蘑菇选择一个他能在 $t$ 秒内打开并完整观看的视频。如果有多个满足条件的视频，他希望选择娱乐值最高的那个。输出任意一个符合条件的视频的编号；若不存在这样的视频，则输出 $-1$。

The first line of the input data contains a single integer $q$ ($1 \le q \le 1000$) — the number of test cases in the test.

The description of the test cases follows.

The first line of a test case contains two integers $n$ and $t$ ($1 \le n \le 50$, $1 \le t \le 200$) — the number of videos in the feed and seconds for lunch, respectively.

The second line of a test case contains $n$ integers $a_1, a_2, a_3, \dots, a_n$ ($1 \le a_i \le 100$) — durations of videos.

The third line of a test case contains $n$ integers $b_1, b_2, b_3, \dots, b_n$ ($1 \le b_i \le 100$) — entertainment values of videos.

输入数据的第一行包含一个整数 $q$（$1 \le q \le 1000$），表示测试用例的数量。

随后是各测试用例的描述。

每个测试用例的第一行包含两个整数 $n$ 和 $t$（$1 \le n \le 50$，$1 \le t \le 200$），分别表示信息流中视频的数量以及午餐时间（单位：秒）。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, a_3, \dots, a_n$（$1 \le a_i \le 100$），表示各视频的时长。

每个测试用例的第三行包含 $n$ 个整数 $b_1, b_2, b_3, \dots, b_n$（$1 \le b_i \le 100$），表示各视频的娱乐值。

Output $q$ integers, each of which is the answer to the corresponding test case. As an answer, output the index of the most entertaining video that Mushroom will have time to watch. If there are several answers, you are allowed to output any of them. Output $-1$, if there is no video he can watch during his lunch break.

输出 $q$ 个整数，每个整数对应一个测试用例的答案。作为答案，请输出蘑菇（Mushroom）在午休时间内能够观看的娱乐性最高的视频的索引。若存在多个满足条件的答案，可任选其一输出。若他在午休期间无法观看任何视频，则输出 $-1$。