using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        var N = sc.Int;
        var XY = new int[N][];var P = new List<int>();
        for (int i = 0; i < N; i++)
        {
            int x, y;
            sc.Make(out x, out y);
            XY[i] = new[] { x, y };P.Add(x);
        }
        var Q = sc.Int;
        var qry = new int[Q][];
        for (int i = 0; i < Q; i++)
        {
            int sx, tx, sy, ty;
            sc.Make(out sx, out tx, out sy, out ty);
            tx++;ty++;
            qry[i] = new[] { sx, tx, sy, ty };
            P.Add(sx);P.Add(tx);
        }
        var d = Compression(P);
        var g = Create(d.Count, () => new List<Tuple<int, int>>());
        for (int i = 0; i < N; i++)
        {
            g[d[XY[i][0]]].Add(new Tuple<int, int>(XY[i][1], i));
        }
        var seg = new SegmentTreeFractionalCascading(g);
        foreach (var q in qry)
        {
            seg.Query(d[q[0]], d[q[1]], q[2], q[3]);
        }
    }
    public static Dictionary<T, int> Compression<T>(IList<T> A, int d = 0, Comparison<T> cmp = null)
    {
        cmp = cmp ?? Comparer<T>.Default.Compare;
        var dic = new Dictionary<T, int>();
        var cp = A.ToArray();
        Array.Sort(cp, (a, b) => cmp(a, b));
        for (var i = 0; i < cp.Length; i++)
            if (!dic.ContainsKey(cp[i]))
                dic[cp[i]] = d++;
        return dic;
    }
}

class SegmentTreeFractionalCascading
{
    Tuple<int, int>[][] seg;
    int[][] L, R;
    int sz;
    public SegmentTreeFractionalCascading(List<Tuple<int, int>>[] A)
    {
        sz = 1;
        while (sz < A.Length) sz <<= 1;
        seg = new Tuple<int, int>[2 * sz - 1][];
        L = new int[2 * sz - 1][];
        R = new int[2 * sz - 1][];
        for (int i = 0; i < sz; i++)
        {
            if (i < A.Length)
            {
                seg[i + sz - 1] = A[i].ToArray();
                Array.Sort(seg[i + sz - 1], (a, b) => a.Item1 - b.Item1);
            }
            else
            {
                seg[i + sz - 1] = new Tuple<int, int>[0];
            }
        }
        for (int k = sz - 2; k >= 0; k--)
        {
            seg[k] = new Tuple<int, int>[seg[2 * k + 1].Length + seg[2 * k + 2].Length];
            L[k] = new int[seg[k].Length + 1];
            R[k] = new int[seg[k].Length + 1];
            int t1 = 0, t2 = 0;
            for (int i = 0; i < seg[k].Length; i++)
            {
                L[k][i] = t1;
                R[k][i] = t2;
                if (t1 == seg[2 * k + 1].Length)
                {
                    seg[k][i] = seg[2 * k + 2][t2++];
                }
                else if (t2 == seg[2 * k + 2].Length)
                {
                    seg[k][i] = seg[2 * k + 1][t1++];
                }
                else
                {
                    if (seg[2 * k + 1][t1].Item1 < seg[2 * k + 2][t2].Item1)
                        seg[k][i] = seg[2 * k + 1][t1++];
                    else
                        seg[k][i] = seg[2 * k + 2][t2++];
                }
            }
            L[k][seg[k].Length] = seg[2 * k + 1].Length;
            R[k][seg[k].Length] = seg[2 * k + 2].Length;
        }
    }
    List<int> res=new List<int>();
    public void Query(int l, int r, int d, int u)
    {
        d = LowerBound(seg[0], new Tuple<int, int>(d, -1), (a, b) => a.Item1.CompareTo(b.Item1));
        u = LowerBound(seg[0], new Tuple<int, int>(u, -1), (a, b) => a.Item1.CompareTo(b.Item1));
        res.Clear();
        Query(l, r, d, u, 0, 0, sz);
        res.Sort();
        for (int i = 0; i < res.Count; i++)
        {
            Console.WriteLine(res[i]);
        }
        Console.WriteLine();
    }
    void Query(int l, int r, int lw, int up, int k, int lft, int rgt)
    {
        if (rgt <= l || r <= lft) return;
        if (l <= lft && rgt <= r)
        {
            for (int i = lw; i < up; i++)
                res.Add(seg[k][i].Item2);
            return;
        }
        Query(l, r, L[k][lw], L[k][up], 2 * k + 1, lft, (lft + rgt) >> 1); Query(l, r, R[k][lw], R[k][up], 2 * k + 2, (lft + rgt) >> 1, rgt);
    }
    #region UpperBound/LowerBound
    public static int UpperBound<T>(IList<T> array, T value, Comparison<T> cmp = null)
    {
        cmp = cmp ?? Comparer<T>.Default.Compare;
        var low = -1;
        var high = array.Count;
        while (high - low > 1)
        {
            var mid = (high + low) / 2;
            if (cmp(array[mid], value) == 1) high = mid;
            else low = mid;
        }
        return high;
    }

    public static int LowerBound<T>(IList<T> array, T value, Comparison<T> cmp = null)
    {
        cmp = cmp ?? Comparer<T>.Default.Compare;
        var low = -1;
        var high = array.Count;
        while (high - low > 1)
        {
            var mid = (high + low) / 2;
            if (cmp(array[mid], value) != -1) high = mid;
            else low = mid;
        }
        return high;
    }
    #endregion
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion



Measured memory_bytes: 333244