Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Race

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputToday *s* kilometer long auto race takes place in Berland. The track is represented by a straight line as long as *s* kilometers. There are *n* cars taking part in the race, all of them start simultaneously at the very beginning of the track. For every car is known its behavior — the system of segments on each of which the speed of the car is constant. The *j*-th segment of the *i*-th car is pair (*v*_{i, j}, *t*_{i, j}), where *v*_{i, j} is the car's speed on the whole segment in kilometers per hour and *t*_{i, j} is for how many hours the car had been driving at that speed. The segments are given in the order in which they are "being driven on" by the cars.

Your task is to find out how many times during the race some car managed to have a lead over another car. A lead is considered a situation when one car appears in front of another car. It is known, that all the leads happen instantly, i. e. there are no such time segment of positive length, during which some two cars drive "together". At one moment of time on one and the same point several leads may appear. In this case all of them should be taken individually. Meetings of cars at the start and finish are not considered to be counted as leads.

Input

The first line contains two integers *n* and *s* (2 ≤ *n* ≤ 100, 1 ≤ *s* ≤ 10^{6}) — the number of cars and the length of the track in kilometers. Then follow *n* lines — the description of the system of segments for each car. Every description starts with integer *k* (1 ≤ *k* ≤ 100) — the number of segments in the system. Then *k* space-separated pairs of integers are written. Each pair is the speed and time of the segment. These integers are positive and don't exceed 1000. It is guaranteed, that the sum of lengths of all segments (in kilometers) for each car equals to *s*; and all the leads happen instantly.

Output

Print the single number — the number of times some car managed to take the lead over another car during the race.

Examples

Input

2 33

2 5 1 2 14

1 3 11

Output

1

Input

2 33

2 1 3 10 3

1 11 3

Output

0

Input

5 33

2 1 3 3 10

1 11 3

2 5 3 3 6

2 3 1 10 3

2 6 3 3 5

Output

2

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/25/2019 03:31:25 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|