Just Buy Your Drinks, Please

Jaehyun has taken up a hobby of mixing various liquids to make drinks.

The mart sells $n$ liquids numbered $0, 1, \ldots, n - 1$. Liquid $i$ has a taste of $d_i$ and costs $p_i$ per liter. A single bottle of the drink Jaehyun makes may use at most $l_i$ liters of liquid $i$. (Breaking this rule may put your health in serious danger.)

A bizarre rumor spread that drinking Jaehyun's beverage lets you trade health for problem-solving skill, so $m$ people came to Jaehyun's house to drink one bottle each. Person $j$ wants the liquid used to make one bottle to cost at most $g_j$ and the volume to be at least $L_j$ liters. Under these conditions, person $j$ wants to maximize the taste of the drink. Here, the taste of a drink is the minimum among the tastes of the liquids that make it up.

For each person, output the taste of the drink that person will drink. If you cannot serve a drink, output -1.

The first line contains two integers $n, m$ ($1 \le n, m \le 100\,000$).

Then $n$ lines follow, each with three integers $d_i, p_i, l_i$. ($1 \le d_i, p_i, l_i \le 10^5$)

Then $m$ lines follow, each with two integers $g_i, L_i$. ($1 \le g_i, L_i \le 10^{18}$)

Output the answers in $m$ lines. On line $i$, output the taste of the drink person $i$ will drink. If you cannot serve a drink, output -1.