////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
#include <type_traits>
#include <mutex>
#include <array>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;
#define long long long

#define EPS 1e-9
#define INF (1L << 28)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

#define PRED(a,exp) [&](const auto & a) -> bool { return exp; }
#define COMP(a,b,exp) [&](const auto & a, const auto & b) -> bool { return exp; }
#define CONV2(a,b,exp) [&](const auto & a, const auto & b) -> auto { return exp; }

inline int sign_of(double x) { return abs(x) < EPS ? 0 : x > 0 ? 1 : -1; }
inline bool inRange(int val, int min, int max) { return val >= min && val < max; }
inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
inline bool inRange(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まない

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

//// i/o helper ////

namespace std {
	template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
	template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }
}
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; v.reserve(n); REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; v.reserve(n); REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T> struct iter_pair_t { T beg, end; };
template <class T> iter_pair_t<T> iter_pair(T beg, T end) { return iter_pair_t<T>{beg, end}; }
template <class T> ostream & operator << (ostream &out, const iter_pair_t<T> &v)
{
	std::copy(v.beg, v.end, ostream_iterator<typename decltype(v.beg)::reference>(out, " "));
	return out;
}
template <class T1> ostream & operator << (ostream &out, const vector<T1> &v) { return out << iter_pair(begin(v), end(v)); }
template <class T1> ostream & operator << (ostream &out, const set<T1> &v) { return out << iter_pair(begin(v), end(v)); }
template <class T1, class T2> ostream & operator << (ostream &out, const map<T1, T2> &v) { return out << iter_pair(begin(v), end(v)); }

struct _Reader { istream &cin; template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { ostream &cout; bool f{ false }; template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__
#define WRITE(...) (_Writer{cout}), __VA_ARGS__; cout << '\n'
#define DEBUG(...) (_Writer{cerr}), __VA_ARGS__; cerr << '\n'

void solve();
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);

	//auto temp = ctype<char>::classic_table();
	//vector<ctype<char>::mask> bar(temp, temp + ctype<char>::table_size);
	//bar[':'] |= ctype_base::space;
	//cin.imbue(locale(cin.getloc(), new ctype<char>(bar.data())));

	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cout << fixed;
	cout << setprecision(std::numeric_limits<double>::max_digits10);
	solve();

	return 0;
}

template <class T, size_t K>
struct KDTree
{
	typedef array<T, K> PT;
	vector<PT> p_;
	vector<int> tree_{};

	static constexpr unsigned int msb(unsigned int v) { REP(i, 5) v |= v >> (1 << i); return (v >> 1) + 1; }
	KDTree(int n) : p_(n), tree_(msb(p_.size()) << 1, -1) { }

	PT& operator [] (int index) { return p_[index]; }

	void build()
	{
		vector<int> work(p_.size());
		iota(allof(work), 0);
		build_internal(work, 0, 1, 0, work.size());
	}

	vector<int> range(PT s, PT e)
	{
		vector<int> ret;
		ret.reserve(p_.size());
		range_internal(ret, s, e, 0, 1, 0, p_.size());
		return ret;
	}

private:
	void build_internal(vector<int> &w, int depth, int i, int l, int r)
	{
		if (r - l == 0) { return; }

		int d = depth % K;
		int m = (r - l - 1) / 2 + l;
		nth_element(w.begin() + l, w.begin() + m, w.begin() + r, COMP(a, b, p_[a][d] < p_[b][d]));
		tree_[i] = w[m];
		build_internal(w, depth + 1, i * 2, l, m);
		build_internal(w, depth + 1, i * 2 + 1, m + 1, r);
	}

	void range_internal(vector<int> &ret, PT s, PT e, int depth, int i, int l, int r)
	{
		if (r - l == 0) { return; }

		PT p = p_[tree_[i]];
		bool inRange = true;
		REP(i, K) { inRange &= p[i] >= s[i] && p[i] < e[i]; }
		if (inRange) { ret.push_back(tree_[i]); }

		int d = depth % K;
		int m = (r - l - 1) / 2 + l;
		if (p[d] >= s[d]) { range_internal(ret, s, e, depth + 1, i * 2, l, m); }
		if (p[d] < e[d]) { range_internal(ret, s, e, depth + 1, i * 2 + 1, m + 1, r); }
	}
};

////////////////////
/// template end ///
////////////////////

void solve()
{
	READ(int, n);

	KDTree<int, 2> tree(n);
	REP(i, n)
	{
		READ(int, x, y);
		tree[i] = { x, y };
	}
	tree.build();
	READ(int, q);
	REP(i, q)
	{
		READ(int, sx, tx, sy, ty);
		auto v = tree.range({ sx, sy }, { tx + 1,ty + 1 });
		sort(allof(v));
		for (auto val : v) { WRITE(val); }
		WRITE("");
	}
}



Measured memory_bytes: 10324