시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 38 12 11 37.931%

## 문제

Ayu is participating in ABC 2018 (Arranging Blocks Competition). In this competition, each contestant is given M minutes and N tasks which should be solved one-by-one in the given order. The contestant who solves the most tasks is the winner. What makes this contest interesting to you (ICPC contestants) is that this contest uses a similar encouragement as ICPC, i.e. balloons. In particular, each time a contestant solves a task, s/he will be given a balloon.

Ayu is convinced that she can defeat all other contestants, except one particular contestant, Budi, her rival. Ayu knows well her skill, i.e. she knows exactly how long it takes for her to solve a particular task. Unsurprisingly, Ayu also knows well Budi’s skill (they are rival for a reason). Let there be two arrays of integers A1..N and B1..N. Ai denotes the time (in minutes) needed by Ayu to solve the ith task, while Bi denotes the time (in minutes) needed by Budi to solve the same ith task.

Here comes the interesting part. Ayu knows that Budi is very sensitive to any disturbingly loud sound like a balloon being popped. Whenever Budi is surprised (due to a balloon being popped), he will lose his concentration and has to repeat the task he’s doing. For example, suppose Budi needs 10 minutes to solve a particular task. If a balloon pops at the 7th minute, then Budi repeats the task at the 7th minute (out of his 10 minutes), causing him to solve the task with 7 + 10 = 17 minutes. If two balloon pops, each at the 7th and 13th minute, then Budi repeats the task at minute 7th (out of his 10 minutes), repeats it again at minute 6th(out of his 10 minutes), and finally solved the task with 7+ 6+ 10 = 23 minutes. If a balloon pops at the same time Budi supposed to solve the task (i.e. at the 10th minute in this example), then Budi will also not solve that task. Therefore, Budi has to spend another 10 minutes (for a total of 10 + 10 = 20 minutes) to solve that particular task in this case.

Ayu plans to exploit Budi’s weakness in order to defeat him, i.e. Ayu will strategically use the balloons (popping them at integer minutes) she gets from solving the tasks. Your task in this problem is to find out whether it is possible for Ayu to have the number of solved tasks to be strictly larger than Budi’s. If it is possible, you should output one (any) working plan on when she should pop the balloons.

Note that if Ayu solves a task at exactly the Mth minute, then the task is considered as solved. Similarly, if Budi solves a task at exactly the Mth minute, then the task is considered as solved, except if Ayu decides to pop a balloon at the same time. Also, Ayu can pop a balloon as soon as she receives it. Ayu cannot pop more than one balloon at the same minute. She also cannot pop any balloon after the Mth minute mark.

## 입력

Input begins with a line containing two integers: N M (1 ≤ N ≤ 100000; 1 ≤ M ≤ 109) representing the number of tasks and duration of the competition, respectively. The second line contains N integers Ai (1 ≤ Ai ≤ 109) representing the time needed by Ayu to solve the ith task. The third line contains N integers Bi (1 ≤ Bi ≤ 109) representing the time needed by Budi to solve the ith task.

## 출력

If it is not possible for Ayu to win the competition by having strictly larger number of solved tasks than Budi, simply output −1 in a line. Otherwise, output begins with an integer K in a line representing the number of balloons Ayu needs to pop. The next line contains K integers (each separated by a single space), sorted by increasing order, representing the minute in which Ayu should pop a balloon. You may output any configuration as long as it’s valid, i.e. Ayu has at least one balloon when she pops a balloon, Ayu is not popping a balloon after the contest is over, Ayu is not popping more than one balloon at the same minute, and the configuration causes Ayu to have a larger number of solved tasks than Budi.

## 예제 입력 1

4 30
9 10 10 10
4 10 5 10


## 예제 출력 1

2
12 19


## 예제 입력 2

5 50
10 10 10 10 10
15 12 19 17 20


## 예제 출력 2

0


## 예제 입력 3

5 10
15 10 5 5 5
9 10 10 10 10


## 예제 출력 3

-1


Ayu cannot solve the first task during the competition, so no balloon for her to play with.