You are given n segments on a straight line. For each pair of segments it is known that they either have no common points or all points of one segment belong to the second segment.

Then m queries follow. Each query represents a point on the line. For each query, your task is to find the segment of the minimum length, to which this point belongs.

The first line contains an integer n that is the number of segments (1 ≤ n ≤ 10⁵). i’th of the next n lines contains integers a_i and b_i that are the coordinates of endpoints of the i’th segment (1 ≤ a_i < b_i ≤ 10⁹). The segments are ordered by non-decreasing a_i, and when a_i = a_j they are ordered by decreasing length. All segments are distinct. The next line contains an integer m that is the number of queries (1 ≤ m ≤ 10⁵). j’th of the next m lines contains an integer c_j that is the coordinate of the point (1 ≤ c_j ≤ 10⁹). The queries are ordered by non-decreasing c_j.

For each query output the number of the corresponding segment on a single line. If the point does not belong to any segment, output “-1”. The segments are numbered from 1 to n in order they are given in the input.