2D Range Counting

Problem Description

There are $n$ points $(x_i, y_i)$ on the plane.

Answer $q$ queries. Each query gives a rectangle $[X_1, X_2] \times [Y_1, Y_2]$ and asks how many points lie inside the rectangle.

Input Format

The first line contains two integers $n, q$ ($1\leq n, q\leq 2\times 10^5$).

The next $n$ lines each contain two integers $x_i, y_i$ ($1\leq x_i, y_i \leq 10^9$).

The next $q$ lines each contain four integers $X_1, X_2, Y_1, Y_2$ ($1\leq X_1 \leq X_2 \leq 10^9,\ 1\leq Y_1 \leq Y_2 \leq 10^9$).

Output Format

For each query, output one number, the answer.

Sample Input

5 5
1 3
2 5
3 2
4 4
5 1
1 5 1 5
2 4 3 5
1 3 2 5
100 100 100 100
1 1 3 3

Sample Output

5
2
3
0
1