Post Offices

Input

The input file is binary; all numbers are written in little-endian representation. It contains, in this order:

• 4 bytes representing the number of post offices $N$ (an integer, no more than $3000000$)

• For each post office, there are two numbers $⟨\text{LAT}\text{LONG}⟩$ (4 bytes each) representing the latitude and longitude (in degrees) of the post office. The numbers are single-precision IEEE754 floating point numbers. All latitudes are between $-90$ and $90$ degrees; all longitudes are between $-180$ and $180$ degrees.

• 4 bytes representing the number of packages $M$ (an integer, no more than $500000$)

• For each package, there are two numbers $⟨\text{LAT}\text{LONG}⟩$ (4 bytes each) representing the latitude and longitude (in degrees) of the destination. The numbers are single-precision IEEE754 floating point numbers. All latitudes are between $-90$ and $90$ degrees; all longitudes are between $-180$ and $180$ degrees.

Output

The output file is also binary and contains only 32-bit integers in little-endian representation. For each of the $M$ lines in the input file, it must contain:

• One integer—the number $P$ of post offices in the destination set

• $P$ integers—the indices of the post offices in the destination set, sorted in ascending order (lower indices first). The index of the first post office in the input file is $1$ (so all indices are between $1$ and $N$, inclusively).

Examples