Please in C language & show your result $!!!!!!!!!!!!!!!!!$

Range Search $($kD Tree$)$

The range search problem consists of a set of attributed records S to determine which records from S intersect with a given range.

For n points on a plane, report a set of points which are within in a given range. Note that you do not need to consider insert and delete operations for the set.

Input

n

x$0$ y$0$

x$1$ y$1$

:

xn$-1$ yn$-1$

q

sx$0$ tx$0$ sy$0$ ty$0$

sx$1$ tx$1$ sy$1$ ty$1$

:

sxq$-1$ txq$-1$ syq$-1$ tyq$-1$

The first integer n is the number of points. In the following n lines, the coordinate of the i$-$th point is given by two integers xi and yi$.$

The next integer q is the number of queries. In the following q lines, each query is given by four integers, sxi, txi, syi, tyi.

Output

For each query, report IDs of points such that sxi $<=$ x $<=$ txi and syi $<=$ y $<=$ tyi. The IDs should be reported in ascending order. Print an ID in a line, and print a blank line at the end of output for the each query.

Constraints

$0<=$ n $<=500,000$

$0<=$ q $<=20,000$

$-1,000,000,000<=$ x$,$ y$,$ sx$,$ tx$,$ sy$,$ ty $<=1,000,000,000$

sx $<=$ tx

sy $<=$ ty

For each query, the number of points which are within the range is less than or equal to $100.$

Sample Input $1$

$6$

$21$

$22$

$42$

$62$

$33$

$54$

$2$

$2404$

$41025$

Sample Output $1$

$0$

$1$

$2$

$4$

$2$

$3$

$5$