Mission control operates a deep-space probe that delivers telemetry payloads back to Earth through a chain of relay satellites. For a single transmission, the payload passes through k relay hops in sequence, and hop j adds delay_j milliseconds before forwarding the payload onward; the total time to deliver the payload is the sum of all its hops' delays. Every transmission mission control attempts is held to the same fixed communication window of L milliseconds, checked independently of how the hops are performing: if the total hop delay is at most L, the payload arrives and its value is recorded; if the total delay would exceed L, the transmission is abandoned and marked as lost, no matter how close it came to making it.

Given q transmissions, each with its own payload value and its own chain of hop delays, report the outcome of every transmission in order.

Input format

The first line contains two integers q L. Each transmission is then described by two lines:

• a line with two integers k v, the number of relay hops and the payload value;
• a line with k integers delay_1 ... delay_k (this line has no numbers on it when k is 0).

Output format

Print q lines. For the i-th transmission, print the payload value v if the sum of its hop delays is at most L; otherwise print the single word ABORTED.

Constraints

• 1 <= q <= 1000
• 1 <= L <= 10^9
• 0 <= k <= 1000 for each transmission, and the sum of k over all transmissions is at most 2*10^5
• 0 <= delay_j <= 10^9
• 0 <= v <= 10^9

2 100
3 7
30 40 20
2 99
60 50

7
ABORTED

1 50
0 5

5