Given set of line segments [L_{i}, R_{i}] with integer coordinates of their end points.
Your task is to find the minimal subset of the given set which covers segment [0, M] completely (M is a positive integer).
Input
First line of the input contains an integer M (1 ≤ M ≤ 5000). Subsequent lines of input contain pairs of integers L_{i} and R_{i} (−50000 ≤ L_{i} < R_{i} ≤ 50000). Each pair of coordinates is placed on separate line. Numbers in the pair are separated with space. Last line of input data contains a pair of zeroes. The set contains at least one and at most 99999 segments.
Output
Your program should print in the first line of output the power of minimal subset of segments which covers segment [0, M]. The list of segments of covering subset must follow. Format of the list must be the same as described in input with exception that ending pair of zeroes should not be printed. Segments should be printed in increasing order of their left end point coordinate.
If there is no covering subset then print “No solution” to output.
Samples
input  output 

1
1 0
5 3
2 5
0 0
 No solution

1
1 0
0 1
0 0
 1
0 1

Problem Source: II Collegiate Students Urals Programming Contest. Yekaterinburg, April 34, 1998