Problem Statement

You will implement the hit detection of a wide beam for a 2D vertical shooting game that scrolls from bottom to top. In the game, the player's ship can make a request to the mothership, and the mothership will fire a wide beam. Implement the hit detection of the beam.

The beam's hit detection and the enemy data follow the rules below.

• The width of the beam is the range whose left end is at pixel $xLB$ and which extends rightward to pixel $xRB$ (pixel coordinates counted one pixel at a time from the left edge of the screen toward the right).
• The height of the beam reaches from far below the bottom of the screen (you may consider it infinite) up to the very top of the screen.
• The beam covers a rectangular range exactly aligned with the vertical and horizontal directions, that is, the X axis and the Y axis.
• Since this is a special beam, it naturally does not hit the player's ship.
• The beam is assumed to be fired from the bottom of the screen upward. When it hits an enemy, the beam in that range stops and does not hit enemies behind it.
• The beam counts as a hit if it touches even one dot, and counts as a miss if it is off by even one dot.
• The hitbox of an enemy is also a rectangle exactly aligned with the vertical and horizontal directions, and is never a slanted rectangle.

(This is probably hard to understand from words alone. Refer to the sample inputs, which are explained with figures.)

Input

$N$ $xLB$ $xRB$
$XL_1$ $YU_1$ $XR_1$ $YD_1$
$\dots$
$XL_n$ $YU_n$ $XR_n$ $YD_n$

The screen size is fixed at 1280 pixels wide and 1680 pixels tall. You may assume that all input values are integers and that, except for the number of enemies, they denote pixel coordinates.
The top-left dot of the screen is (1,1) and the bottom-right dot of the screen is (1280,1680).
You may assume that each enemy is always partly or entirely on the screen.
For any two enemies, the dot ranges of their hitboxes never overlap.
If an enemy's left and right, and top and bottom, have the same coordinates, it is treated as an enemy of 1*1 dots.

Output

$H_1$
$\dots$
$H_n$

For each enemy, output on one line $H_i$, which is 1 if enemy $i$ is hit by the special beam and 0 otherwise.

Sample

6 30 200
25 150 50 175
100 150 125 175
150 150 175 175
75 100 160 125
74 50 100 75
130 50 165 75

1
1
1
1
1
0

6 30 190
-20 75 50 100
80 120 130 140
166 90 200 120
40 45 165 60
140 10 200 20
35 20 50 30

1
1
1
1
0
0