import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Scanner; import java.util.Comparator; import java.util.Collections; import java.util.ArrayList; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; Scanner in = new Scanner(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskB solver = new TaskB(); solver.solve(1, in, out); out.close(); } static class TaskB { public void solve(int testNumber, Scanner in, PrintWriter out) { int n = in.nextInt(); ArrayList p = new ArrayList<>(); ArrayList h = new ArrayList<>(); for (int i = 0; i < n; i++) { int maxP = in.nextInt(); int minH = in.nextInt(); p.add(maxP); h.add(minH); } int m = in.nextInt(); ArrayList ms = new ArrayList<>(); for (int i = 0; i < m; i++) { int cp = in.nextInt(); int ch = in.nextInt(); int id = i + 1; ms.add(new TaskB.Mentaiko(cp, ch, id)); } for (int i = 0; i < n; i++) { int cp = p.get(i); int ch = h.get(i); for (TaskB.Mentaiko cm : ms) { if (cp >= cm.getPrice() && ch <= cm.getHot()) cm.setSold(cm.getSold() + 1); } } Comparator soldNumComparator = Comparator.comparing(TaskB.Mentaiko::getSold); ms.sort(soldNumComparator.reversed()); int max = ms.get(0).getSold(); if (max == 0) { out.println(0); return; } ArrayList best = new ArrayList<>(); for (TaskB.Mentaiko cm : ms) { if (cm.getSold() != max) break; best.add(cm.getId()); } Collections.sort(best); for (int i : best) out.println(i); } static class Mentaiko { private int price; private int hot; private int sold; private int id; protected Mentaiko(int price, int hot, int id) { this.price = price; this.hot = hot; this.id = id; this.sold = 0; } public void setSold(int sold) { this.sold = sold; } public int getSold() { return sold; } public int getId() { return id; } public int getHot() { return hot; } public int getPrice() { return price; } } } }