Wall#10958
During her trip, Maria saw many architectural landmarks. She was most impressed by a huge wall, made of stones. The wall was in the shape of a perfect rectangle and was made of individual stones of equal height (their widths were not necessarily equal), which were arranged in rows one above another. The count of the stones was and they were numbered with different integers from 1 to . On each stone was written its number. Maria noticed that the stones in each row were not necessarily placed from left to right in ascending order of their numbers.
What made an even stronger impression on the girl, was that the edges formed between the stones of two adjacent rows did not coincide, i.e. the edges are not exactly one above the other. In addition, she made a list of all pairs of integers u_{i} and d_{i}, such that the stone with number u_{i} lies on that with number d_{i}. We say that a stone lies on top of another, if the first stone is positioned one row higher than the second stone and the lower side of the first stone touches the upper side of the second stone in a segment with length greater than 0.
Now the girl asked her father to reproduce this architectural masterpiece on a large sheet of paper, divided into unit squares, setting the following conditions:
The count of the stones remains unchanged;
The drawn wall should be a perfect rectangle;
There should be no edges on two adjacent rows, which are exactly one above the other;
The height of each stone should be one unit;
The width of each stone, chosen by her father, can be arbitrary, but it must be an integer greater than 0;
If a stone was on top of another in the original wall, this should be the same in the reproduction;
Also for the stones described, the lower side of the upper stone must overlap with the upper side of the lower stone on a segment of integer length greater than 0.
Task. Write a program wall that determines the dimensions of the rectangle with the smallest area, which will represent the wall, keeping the conditions set by Maria.
From the first line of the standard input read two integers and – the count of the stones and the count of the pairs in the list. From each of the following lines read two integers u_{i} and d_{i}, which denote that the stone with number u_{i} lies on top of the stone with number d_{i}. From the last line read an integer value of 0 or 1. If this value is 1, then it is guaranteed that the numbers of the stones from left to right in each row of the original wall are in ascending order. This does not mean that you must find an arrangement of the stones with this property in the reproduction.
On the first line of the standard output, print two integers and , respectively the height and the width of the rectangle with minimal area representing the wall. On each of the following lines of the output, print a description of one possible arrangement of the stones in the new wall – the -th such line should contain a single k_{i} – the count of the stones on the -th row of the wall, followed by k_{i} pairs of integers, which consist of the number of the consecutive stone and its width in units. Every two consecutive numbers must be separated with a single space.
The stones must be printed by rows from the top to the bottom of the wall.
If the task has many possible solutions, then print any of them.
Example 1
Example 2
Explanation of the example: The diagram shows one possible arrangement of the stones in the reproduced wall for the first example, in which a minimum area of the rectangle representing the wall is achieved, so that all set conditions are met.
The test cases are divided into groups, each of which consists of three consecutive tests. The points for each group are given only if your solution passes all three tests from the group.
In around 15% of the groups: 1 \leq N \leq 10.
In other around 40% of the groups: the numbers of the stones in each row of the original wall are in ascending order from left to right.