시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 1024 MB 0 0 0 0.000%

문제

Mirko recently read about Pick’s theorem that says the following: in the coordinate system, if we draw a polygon whose vertices are points with integer coordinates, and if A denotes its area, i the number of points with integer coordinates located inside the polygon, and b the number of points with integer coordinates located on its edges (including the polygon’s vertices), then it always holds:

A = i + (b/2) - 1.

In order to test the theorem, Mirko used his smart board to create a polygon from magnetic sticks that have, during the night, sunk to the bottom of the board because due to gravity. Now, Mirko wants to construct a polygon of the minimal possible area while using all the sticks he found. Mirko can move the sticks anywhere on his board, but he must not rotate them. Mirko is equipped with the following:

  • a horizontal sticks of length 1,
  • b vertical sticks of length 1,
  • c diagonal sticks of length √2 that form a 45° angle with the positive part of x-axis,
  • d diagonal sticks of length √2 that form a 135° angle with the positive part of x-axis.
Figure 2: For the polygon above: A = 8, i = 4, b = 10. Figure 3: The sticks Mirko is equipped with.

Determine the polygon of the minimal possible area that can be obtained so that all the sticks are used. You can assume that the input data is such that it is possible to construct at least one such polygon.

입력

The first line of input contains four integers a, b, c, d from the task.

출력

You must output n lines where n = a + b + c + d. In the jth line, output integers xj and yj — the coordinates of the jth polygon vertex. The first polygon vertex must be (0, 0), and the other vertices can be printed in an arbitrary direction (either positive or negative). It is allowed that the consecutive polygon sides are parallel, but the polygon cannot touch or intersect itself.

제한

  • 0 ≤ a, b, c, d ≤ 100
  • a + b + c + d ≥ 3

예제 입력 1

1 1 1 0

예제 출력 1

0 0
1 1
0 1

예제 입력 2

0 0 6 4

예제 출력 2

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