As they say, every man must build a house, plant a tree, and grow a son during his life. So a programmer Vasechkin decided not to stay behind and to start building his own house. Vasechkin knew that his taste was not bad and thus he himself decorated the facade with brickwork. He carefully attached each brick with cement solution to a vertical wall. The result was very nice. Each brick was placed horizontally and lay on no more than one brick from the lower row. Vasechkin finished his work and thought. The time would pass and the cement solution between the bricks would crack. And one would like this beauty to remain for ages. So would it be stable even without the cement? It is necessary to perform complicated calculations, taking into consideration that all bricks have the same height, density, and width, but different lenghts. Also, a brick (or a system of bricks) with center of gravity on the edge of its support or outside it is considered to be unstable.
Input
The first line contains an integer H, which is the number of brick rows, i.e., the height of the wall (1 ≤ H ≤ 10000). Then the disposition of bricks in the rows is given, row by row, beginning from the topmost one. For each row, there is a line containing an integer K, which is the number of bricks in this row (0 ≤ K ≤ 1000); each of the next K lines contains two integers L_{i} and R_{i}, which are the coordinates of the left and right edges of the ith brick. It is known that L_{i} < R_{i} < L_{i+1} and 0 ≤ L_{i}, R_{i} ≤ 10000. The number of all bricks is between 1 and 100 000.
Output
You should write a program that outputs “Yes” if all the bricks are stable and “No” otherwise.
Sample
input  output 

3
1
10 20
3
1 7
13 17
100 200
2
0 20
60 160
 Yes

Problem Author: Idea  Alexey Lakhtin, prepared by Alexey Lakhtin
Problem Source: VIII Collegiate Students Urals Programming Contest. Yekaterinburg, March 1116, 2004