Dream, Passion, Sharing

Jaewon is a Dimigo student who is choosing teammates for the Dimigo startup idea contest.

A team can enter the contest with at most $M$ members.

Under the school motto of dream, passion, and sharing, each of the $N+1$ Dimigo students, including Jaewon, has dream, passion, and sharing stats. Jaewon's number is $0$, and his stats are $V_0$, $P_0$, and $S_0$. The other $N$ students are numbered from $1$ to $N$, and student $i$ has stats $V_i$, $P_i$, and $S_i$.

Jaewon wants to choose teammates so that the team, including himself, has at least 1 and at most $M$ members, and the total of all members' dream, passion, and sharing stats is as large as possible.

Jaewon wants to keep his team easy to manage, so he will not pick any student whose stat total is greater than his own stat total $V_0+P_0+S_0$.

The first line contains the number of students $N$ and the maximum team size $M$, separated by a space. $(1 \leq N \leq 10^5;$ $1 \leq M \leq N+1)$

The second line contains Jaewon's stats $V_0$, $P_0$, and $S_0$, separated by spaces. $(1 \leq V_0, P_0, S_0 \leq 10^8)$

From the third line onward, the $N$ lines give student $i$'s stats $V_i$, $P_i$, and $S_i$, separated by spaces. $(1 \leq i \leq N;$ $1 \leq V_i, P_i, S_i \leq 10^8)$

All input numbers are integers.

Print the numbers of the students on the team, including Jaewon's number, separated by spaces, for a team that satisfies the conditions.

If several teams maximize the total stats, print any one of them.

The members may be printed in any order.