TubeTube Feed

Description:

Input:

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.

Output:

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.

Sample Input:

5
5 9
1 5 7 6 6
3 4 7 1 9
4 4
4 3 3 2
1 2 3 4
5 7
5 5 5 5 5
2 1 3 9 7
4 33
54 71 69 96
42 24 99 1
2 179
55 66
77 88

Sample Output:

3
2
3
-1
2