B"Monocarp is playing a strategy game. In the game, he recruits a squad to fight monsters. Before each battle, Monocarp has C coins to spend on his squad. Before each battle starts, his squad is empty. Monocarp chooses one type of units and recruits no more units of that type than he can recruit with C coins. There are n types of units. Every unit type has three parameters: Monocarp has to face m monsters. Every monster has two parameters: Monocarp has to fight only the j -th monster during the j -th battle. He wants all his recruited units to stay alive. Both Monocarp's squad and the monster attack continuously (not once per second) and at the same time. Thus, Monocarp wins the battle if and only if his squad kills the monster strictly faster than the monster kills one of his units. The time is compared with no rounding. For each monster, Monocarp wants to know the minimum amount of coins he has to spend to kill that monster. If this amount is greater than C , then report that it's impossible to kill that monster. The first line contains two integers n and C ( 1 <= n <= 3 cdot 10^5 ; 1 <= C <= 10^6 ) -- the number of types of units and the amount of coins Monocarp has before each battle. The i -th of the next n lines contains three integers c_i, d_i and h_i ( 1 <= c_i <= C ; 1 <= d_i, h_i <= 10^6 ). The next line contains a single integer m ( 1 <= m <= 3 cdot 10^5 ) -- the number of monsters that Monocarp has to face. The j -th of the next m lines contains two integers D_j and H_j ( 1 <= D_j <= 10^6 ; 1 <= H_j <= 10^{12} ). Print m integers. For each monster, print the minimum amount of coins Monocarp has to spend to kill that monster. If this amount is greater than C , then print -1 . Consider the first monster of the first example. Monocarp can't recruit one unit of the first type, beca"...