eolymp
bolt
Try our new interface for solving problems
Problems

Random problem

Random problem

Time limit 4 seconds
Memory limit 512 MiB

Marty decided to distract his friend Alex from thinking about juicy steaks and entertain him with one interesting puzzle.

First, he randomly chose n points (x[i], y[i]) (0x[i], y[i] 10^9). Then, he randomly chose two indices i and j (1i, jn) with equal probability. After that, he calculated the value k = x[i] * x[j] + y[i] * y[j].

Now he gave Alex n points and the number k. And asks him to find any pair of indices a and b such that x[a] * x[b] + y[a] * y[b] = * k*. Alex does not want to solve this problem, so help him.

Input data

The first line contains two integers n and k (1n200 000, 0k2 * 10^18).

The next n lines contain two integers x[i] and y[i] the coordinates of the i-th point (0x[i], y[i]10^9). It is guaranteed that the points were generated randomly with equal probability.

It is guaranteed that k was evaluated as x[i] * x[j] + y[i] * y[j], where i and *j * were chosen randomly with equal probability.

Output data

Print two integers a and b (1a, bn) such that x[a] * x[b] + y[a] * y[b] = k. If there are several suitable answers, you can print any one.

Examples

Input example #1
1 1476978419092933556
901418150 815121916
Output example #1
1 1
Input example #2
10 95652677520045149
805513144 38998401
16228409 266085559
293487744 471510400
138613792 649258082
904651590 244678415
443174087 503924246
579288498 219903162
179297759 762760972
92837851 728185679
983905980 299473031
Output example #2
10 2
Source 2020 Cycle of Internet Olympiads for schoolchildren, Fifth team contest, Novemver 28, Advanced level, Problem F