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.

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.

Input


n
x0 y0
x1 y1
:
xn-1 yn-1
q
sx0 tx0 sy0 ty0
sx1 tx1 sy1 ty1
:
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.

Example

Input

6
2 1
2 2
4 2
6 2
3 3
5 4
2
2 4 0 4
4 10 2 5


Output

0
1
2
4

2
3
5
#include <cstdio>
#include <algorithm>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

template <class T>
using lp_queue=priority_queue<T, deque<T>, greater<T>>;

struct Point {
    int first, second;
    size_t index;
    Point(int f=0, int s=0, size_t i=0): first(f), second(s), index(i) {}
    bool operator<(const Point &rhs) const {
        if (first != rhs.first) {
            return first < rhs.first;
        } else {
            return second < rhs.second;
        }
    }
};

int main() {
    size_t n;
    scanf("%zu", &n);

    vector<Point> S(n), T(n);
    for (size_t i=0; i<n; ++i) {
        int x, y;
        scanf("%d %d", &x, &y);

        S[i].first = T[i].second = x;
        S[i].second = T[i].first = y;
        S[i].index = T[i].index = i;
    }

    sort(S.begin(), S.end());
    sort(T.begin(), T.end());

    size_t q;
    scanf("%zu", &q);

    for (size_t i=0; i<q; ++i) {
        int sx, tx, sy, ty;
        scanf("%d %d %d %d", &sx, &tx, &sy, &ty);

        lp_queue<size_t> q;
        size_t x_lb=lower_bound(S.begin(), S.end(), Point(sx, sy))-S.begin();
        size_t x_ub=upper_bound(S.begin(), S.end(), Point(tx, ty))-S.begin();
        size_t y_lb=lower_bound(T.begin(), T.end(), Point(sy, sx))-T.begin();
        size_t y_ub=upper_bound(T.begin(), T.end(), Point(ty, tx))-T.begin();

        ptrdiff_t x_diff=x_ub-x_lb, y_diff=y_ub-y_lb;
        if (x_diff < y_diff) {
            for (size_t i=x_lb; i<x_ub; ++i) {
                int y=S[i].second;
                if (sy<=y && y<=ty)
                    q.push(S[i].index);
            }
        } else {
            for (size_t i=y_lb; i<y_ub; ++i) {
                int x=T[i].second;
                if (sx<=x && x<=tx)
                    q.push(T[i].index);
            }
        }

        while (!q.empty()) {
            printf("%zd\n", q.top());
            q.pop();
        }
        printf("\n");
    }

    return 0;
}