import bisect

def main():
    N = int(input())
    AB = [tuple(map(int, input().split())) for _ in [0] * N]
    M = int(input())
    XY = tuple(tuple(map(int, input().split())) for _ in [0] * M)

    a = [0] * N
    b = a[:]
    AB.sort()
    for i, j in enumerate(AB):
        a[i], b[i] = j

    men = [0] * M
    for i, (x, y) in enumerate(XY):
        j = bisect.bisect_left(a, x)
        b_ = b[j:]
        b_.sort()
        k = bisect.bisect(b_, y)
        men[i] += k

    max_ = max(men)
    if not max_:
        print(0)
    else:
        ans = [i + 1 for i, j in enumerate(men) if j == max_]
        print(*ans, sep='\n')

main()