Today the North Pole hosts an Olympiad in a sport called... toy igloo skyscrapers' building!

There are n walruses taking part in the contest. Each walrus is given a unique number from 1 to n. After start each walrus begins to build his own igloo skyscraper. Initially, at the moment of time equal to 0, the height of the skyscraper i-th walrus is equal to a_i. Each minute the i-th walrus finishes building b_i floors.

The journalists that are reporting from the spot where the Olympiad is taking place, make q queries to the organizers. Each query is characterized by a group of three numbers l_i, r_i, t_i. The organizers respond to each query with a number x, such that:

1. Number x lies on the interval from l_i to r_i inclusive (l_i ≤ x ≤ r_i).

2. The skyscraper of the walrus number x possesses the maximum height among the skyscrapers of all walruses from the interval [l_i, r_i] at the moment of time t_i.

For each journalists' query print the number of the walrus x that meets the above-given criteria. If there are several possible answers, print any of them.

The first line contains numbers n and q (1 ≤ n, q ≤ 10⁵). Next n lines contain pairs of numbers a_i, b_i (1 ≤ a_i, b_i ≤ 10⁹). Then follow q queries i the following format l_i, r_i, t_i, one per each line (1 ≤ l_i ≤ r_i ≤ n, 0 ≤ t_i ≤ 10⁶). All input numbers are integers.

For each journalists' query print the number of the walrus x that meets the criteria, given in the statement. Print one number per line.