P7089 [NWRRC 2013] Kids in a Friendly Class

Kevin resembles his class in primary school. There were girls and boys in his class. Some of them were friends, some were not. But if one person considered another person a friend, the opposite was also true. Interestingly, every girl had exactly a friends among girls and exactly $b$ friends among boys, whereas every boy had exactly $c$ friends among girls and exactly $d$ friends among boys. Kevin does not remember the size of his class. Help him reconstruct the class with minimal possible number of kids, such that the above conditions are satisfied.

The only line contains four integers $a , b , c$ , and $d (1 \le a , b , c , d \le 50)$ .

Output an example of a class of minimal possible size satisfying the above conditions. The first line should contains two positive integers: $m$ -- the number of girls, and $n$ -- the number of boys. Let's assign numbers $1$ through $m$ to the girls and $m + 1$ through $m + n$ to the boys. Each of the next lines should contain a pair of distinct integers describing a pair of friends by their numbers. Each pair of friends should appear exactly once in this list.

Time limit: 2 s, Memory limit: 256 MB.