Problem 0K. Kind of cheating ≡

Statement

Paulundra is participating in speed climbing competitions. This discipline involves participants undergoing qualification rounds, followed by paired races. The following rules apply during a paired race:

• If one participant in the paired race falls, they lose.
• If both participants finish, the participant with the better time wins.
• In case of equal times or if both participants fall, the participant with the better qualification time wins.

Paulundra won the qualification with the best time and observed the strategy of each of the n participants in the competition. She knows that participant number i plans to complete the route in t_i seconds and knows the probability in percentage that this participant will fall p_i. Paulundra also knows that she can complete the route in any time between a and b, and the probability of falling at the chosen time x can be calculated as 1 − x − ab − a.

Help Paulundra choose the optimal time x_i for each opponent so that the probability of Paulundra's victory is maximized. If there are multiple optimal times, choose the one that is smaller.

Input format

The first line of input contains two integers a and b. The second line of input contains an integer n. The following n lines each contain two integers t_i and p_i.

Output format

Output n integers x_i.

Constraints

1 ≤ n ≤ 10⁵

1 ≤ a, b, t_i ≤ 10⁹

1 ≤ p_i ≤ 100

a < b

Sample tests

1 5
5
4 10
10 50
1 99
5 50
2 90

4
5
1
5
2