#agc017e. [agc017_e]Jigsaw

[agc017_e]Jigsaw

Problem Statement

We have NN irregular jigsaw pieces. Each piece is composed of three rectangular parts of width 11 and various heights joined together. More specifically:

  • The ii-th piece is a part of height HH, with another part of height AiA_i joined to the left, and yet another part of height BiB_i joined to the right, as shown below. Here, the bottom sides of the left and right parts are respectively at CiC_i and DiD_i units length above the bottom side of the center part.

Snuke is arranging these pieces on a square table of side 1010010^{100}. Here, the following conditions must be held:

  • All pieces must be put on the table.
  • The entire bottom side of the center part of each piece must touch the front side of the table.
  • The entire bottom side of the non-center parts of each piece must either touch the front side of the table, or touch the top side of a part of some other piece.
  • The pieces must not be rotated or flipped.

Determine whether such an arrangement is possible.

Constraints

  • 1leqNleq1000001 \\leq N \\leq 100000
  • 1leqHleq2001 \\leq H \\leq 200
  • 1leqAileqH1 \\leq A_i \\leq H
  • 1leqBileqH1 \\leq B_i \\leq H
  • 0leqCileqHAi0 \\leq C_i \\leq H - A_i
  • 0leqDileqHBi0 \\leq D_i \\leq H - B_i
  • All input values are integers.

Input

Input is given from Standard Input in the following format:

NN HH A1A_1 B1B_1 C1C_1 D1D_1 A2A_2 B2B_2 C2C_2 D2D_2 : ANA_N BNB_N CNC_N DND_N

Output

If it is possible to arrange the pieces under the conditions, print YES; if it is impossible, print NO.


Sample Input 1

3 4
1 1 0 0
2 2 0 1
3 3 1 0

Sample Output 1

YES

The figure below shows a possible arrangement.


Sample Input 2

4 2
1 1 0 1
1 1 0 1
1 1 0 1
1 1 0 1

Sample Output 2

NO

Sample Input 3

10 4
1 1 0 3
2 3 2 0
1 2 3 0
2 1 0 0
3 2 0 2
1 1 3 0
3 2 0 0
1 3 2 0
1 1 1 3
2 3 0 0

Sample Output 3

YES