403392: GYM101149 G Of Zorcs and Axes

Zorcs don't like other species. Zorcs like massive curve axes. Right now each of them is going to choose a suitable axe and show beings of other races entrenched nearby that they are not ready to peaceful cultural assimilation. There are n zorcs and m axes in total, and the i-th zorc wants to take an axe with the weight not less than a_i and the curvature not less than b_i, while the j-th axe has the weight w_j and the curvature c_j. Zorcs don't like programming problems. Zorcs like massive curve axes. So it's your task to determine which zorc must choose which axe.

The first line contains a single integer n (1 ≤ n ≤ 2·10⁵) — the number of zorcs.

Each of the next n lines contains two space-separated integers: a_i and b_i (1 ≤ a_i, b_i ≤ 10⁹) — the minimal weight and curvature of the axe that suits the i-th zorc.

The next line contains a single integer m (1 ≤ m ≤ 2·10⁵) — the number of axes.

Each of the next m lines contains two space-separated integers: w_j and c_j (1 ≤ w_j, c_j ≤ 10⁹) — the weight and the curvature of the j-th axe.

Output n integers, the i-th of which must be the number of axe that should be given to the i-th zorc to fulfill all his requirements. Of course, the same axe can't be given to two different zorcs.

If there is no possibility to distribute axes, fulfilling all requirements of all zorcs, output a single number  - 1 instead of that.

3
3 4
5 1
2 6
4
5 7
4 5
3 3
5 2

2 4 1

2
2 5
4 3
2
5 6
3 4

-1