#P2227. Distribution

Distribution

One day , Wang and Dong in the Dubai desertexpedition, discovered an ancient castle. Fortunately, they found a map of thecastle.The map marks the location of treasures.<o:p></o:p>

They agreed to distribute the treasures according to the following rules:<o:p></o:p>



Wang draws a horizontal line on the map and then Dong draws a vertical one so that the map is divided into 4 parts, as show below. 

Wang will save the treasures in I and III ,while those situated in II and IV will betaken away by Dong. Wangfirst draw a horizontal line, Dong after the draw a vertical line. <o:p></o:p>

They drewseveral pairs of  lines. For each pair, Wangwants to know the difference between their treasures.<o:p></o:p>

It's guaranteed that all the reasures will lie on neither of the linesdrew by them.<o:p></o:p>

Input

the first line contains two integers N and M, where N is the number of treasures on the map and M indicates how many times they are going to draw the lines. The 2nd to (N+1)-th lines Xi, Yi contain the co-ordinates of the treasures and the last M lines consist of the M pairs integers (X, Y) which means that the two splitting lines intersect at point (X, Y).
( 0 < N, M ≤ 100, 0 ≤ Xi, Yi, X,Y ≤ 1000 )

Output

Output contains M lines , a single line with a integer , the difference described above

Sample Input

10 3 
29 22
17 14 
18 23
3 15
6 28
30 27
4 1
26 7
8 0
11 21
2 25
5 10
19 24

Sample Output

</p>
-6
4
4

HINT

Source