Windows

Emma is careless with her computer's desktop: she keeps opening windows and never closes the applications that created them. Her desktop becomes a cluttered pile in which some windows only peek out from behind others and some are hidden entirely. Because Emma leaves her machine on for days, the mess grows enormous. Your task is to determine which window (if any) is selected when Emma clicks a given point on the screen.

When Emma clicks, the selected window is the topmost window covering that point — that is, the most recently opened window that contains it. Clicking a window does not bring it to the front.

The screen has a resolution of $10^6 \times 10^6$ pixels. The pixel in the upper-left corner of the desktop is at position $(0, 0)$, so the lower-right pixel is at $(999999, 999999)$. Rows are numbered top to bottom and columns left to right. A window is given by the position of its upper-left pixel $(r, c)$ together with its width $w$ and height $h$; it covers exactly the pixels in rows $r$ through $r + h - 1$ and columns $c$ through $c + w - 1$.

The input contains a sequence of desktop descriptions.

Each description begins with a line containing a positive integer $n$ ($n \le 100$), the number of windows, followed by $n$ lines listing the windows in the order Emma opened them. Each window line contains four integers $r$, $c$, $w$, and $h$: $(r, c)$ is the row and column of the window's upper-left pixel ($0 \le r, c \le 999999$), and $w$ and $h$ are its width and height in pixels ($w, h \ge 1$). Every window lies entirely on the desktop, so no window is cropped.

After the window lines comes a line with a positive integer $m$, the number of queries, followed by $m$ lines. Each query line contains two integers $cr$ and $cc$, the row and column of a clicked location, which is always on the desktop.

The input ends with a line containing a single $0$ in place of the window count $n$.

For each desktop description, in the order given, first print a line Desktop k:, where $k$ is the desktop number starting from $1$. Then print $m$ lines, one per query in order: print window k if the click selects the window numbered $k$, or background if the click hits no window. Windows are numbered $1, 2, \ldots, n$ in the order Emma opened them. Remember that a query never changes which window is in front.