Bobo is exploring a set of lattice points on a two-dimensional plane. Initially, the set of points is defined as $$$S = \{(0,0),(A,0),(0,B),(A,B)\}$$$. Bobo's goal is to include a specific lattice point $$$(X,Y)$$$ in $$$S$$$. To achieve the goal, Bobo may perform the following operation:
Your task is to help Bobo find a sequence of operations that minimizes the number of steps to achieve the goal or determine if it is impossible to do so.
The first line of the input contains two integers $$$A$$$ and $$$B$$$ ($$$0 \le A,B \le 10^9$$$), describing the parameters of the initial lattice points.
The second line of the input contains two integers $$$X$$$ and $$$Y$$$ ($$$0 \le X \le A$$$, $$$0 \le Y \le B$$$), denoting the coordinates of the target lattice point.
If it is impossible to achieve the goal, output $$$-1$$$ in one line. Otherwise, output a single integer $$$k$$$ ($$$0 \le k \le 10^5$$$) in one line, denoting the minimum number of operations needed to reach the target. Then print $$$k$$$ lines describing an optimal sequence of operations. The $$$i$$$-th line contains four integers $$$U_i,V_i,S_i,T_i$$$ ($$$0 \le U_i,V_i,S_i,T_i \le 10^9$$$), describing the lattice points $$$P=(U_i,V_i)$$$ and $$$Q=(S_i,T_i)$$$ chosen in the $$$i$$$-th operation. If there are multiple optimal solutions, output any one of them.
2 21 1
1 0 0 2 2
8 85 0
3 0 0 8 0 4 0 8 0 4 0 6 0
0 00 0
0
2024 01012 0
1 0 0 2024 0
2024 20242023 2023
-1
8 67 3
3 0 0 8 0 4 0 8 0 6 0 8 6
| Name |
|---|


