Andriyko enjoys computer graphics, but now he faces a problem. He must arrange photographs on a page (the photographs are stored in electronic format). The page must be completely filled, and the photographs cannot be rotated. Andriyko may change the original sizes of the photographs, but must not distort the images: he must preserve the aspect ratio of each photograph. Rotation is not allowed.
You must determine the final size of each photograph so that all four fill the page exactly, without rotation and while preserving their respective aspect ratios.
The input consists of:
Line 1: Two non-negative integers and , separated by a space, representing the width and height of the page.
Lines 2 to 5: Each line contains a pair of non-negative integers and , separated by a space, representing the width and height of each photograph. The -th photograph is described on line i+1, where 1 \leq i \leq 4.
Constraints:
0 \leq l, h \leq 2000
0 \leq x, y \leq 2000
Output lines:
Each line should contain two non-negative integers and (0 \leq a, b), separated by a space, representing the final width and height of each photograph. The -th photograph corresponds to line , where 1 \leq i \leq 4.
If there are multiple solutions, you may print any of them. It is guaranteed that for every input, at least one solution exists.
Example 1