There is a race going on between N cars the finish being at Z, given an array of positions called X, and an array of their speeds S. Can you predict which car will finish at position 1,2 and 3?

X[i] denotes the current position of ith car,
S[i] denotes the speed of the ith car.

Assume that the cars will move with this speed for the remainder of the race, Also finish time is only calculated in integers. (  Rounded down i.e if car is at 0 finish line =3 and speed =2 , time = 3/2 = 1 )

In case of tie car with lower index is preferred.

Input :

N, Z in separated by space, followed by X in a new line ( N spaced integers), followed by S in next line ( N spaced integers )

Constraints :

3<=N<=10^5 , 2<=Z<=10^9

0<=X[i]<Z , 1<=S[i]<=10^3

Output :

3 spaced integers, denoting the index of 1st 2nd and 3rd cars ( in 0 based indexing)