Favourite dish

France is a country of gastronomy. For a dish, both the taste and plating are important. Nevertheless, when different people evaluate a dish, some focus more on taste and some focus more on plating. At the Olympic Village dining hall, there are $N$ dishes, numbered from $1$ to $N$; each dish has a score on its taste and a score on its plating. There are also $M$ persons, numbered from $1$ to $M$; each person has a weight on taste and a weight on plating. One person’s final score of a dish is the weighted average of the dish’s scores on taste and plating.

The chefs at the Olympics want to provide everyone with their favourite dish on the evening of the closing ceremony. Your task is to calculate everyone’s favourite dish. If multiple dishes tie for the highest score as a person’s favourite, choose the one with the smallest number.

Each line contains two space-separated integers. The first line contains the numbers $N$ and $M$. Then follow $N$ lines; the $k$th such line contains two integers $t\_k$ and $p\_k$, which are the scores of the dish $k$ on taste and on plating. Then come $M$ more lines; the $\ell$th such line contains two integers $T\_\ell$ and $P\_\ell$, which are the weights of person $\ell$ on taste and on plating.

The output should contain $M$ lines. The $\ell$th such line should contain one number: the number of the favourite dish of person $\ell$.

• $1 \le N \le 500\\, 000$
• $1 \le M \le 500\\, 000$
• $0 \le t\_k \le 1\\, 000\\, 000$, $0 \le p\_k \le 1\\, 000\\, 000$, and $(t\_k , p\_k) \ne (0, 0)$ for all $k \le N$
• $0 \le T\_\ell \le 1\\, 000\\, 000$, $0 \le P\_\ell \le 1\\, 000\\, 000$, and $(T\_\ell , P\_\ell) \ne (0, 0)$ for all $\ell \le M$
• the $N$ pairs $(t\_k , p\_k)$ are pairwise distinct
• the $M$ pairs $(T\_\ell , P\_\ell)$ are pairwise distinct