Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
A. Case of Matryoshkas

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAndrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.

The main exhibit is a construction of *n* matryoshka dolls that can be nested one into another. The matryoshka dolls are numbered from 1 to *n*. A matryoshka with a smaller number can be nested in a matryoshka with a higher number, two matryoshkas can not be directly nested in the same doll, but there may be chain nestings, for example, 1 → 2 → 4 → 5.

In one second, you can perform one of the two following operations:

- Having a matryoshka
*a*that isn't nested in any other matryoshka and a matryoshka*b*, such that*b*doesn't contain any other matryoshka and is not nested in any other matryoshka, you may put*a*in*b*; - Having a matryoshka
*a*directly contained in matryoshka*b*, such that*b*is not nested in any other matryoshka, you may get*a*out of*b*.

According to the modern aesthetic norms the matryoshka dolls on display were assembled in a specific configuration, i.e. as several separate chains of nested matryoshkas, but the criminal, following the mysterious plan, took out all the dolls and assembled them into a single large chain (1 → 2 → ... → *n*). In order to continue the investigation Andrewid needs to know in what minimum time it is possible to perform this action.

Input

The first line contains integers *n* (1 ≤ *n* ≤ 10^{5}) and *k* (1 ≤ *k* ≤ 10^{5}) — the number of matryoshkas and matryoshka chains in the initial configuration.

The next *k* lines contain the descriptions of the chains: the *i*-th line first contains number *m*_{i} (1 ≤ *m*_{i} ≤ *n*), and then *m*_{i} numbers *a*_{i1}, *a*_{i2}, ..., *a*_{imi} — the numbers of matryoshkas in the chain (matryoshka *a*_{i1} is nested into matryoshka *a*_{i2}, that is nested into matryoshka *a*_{i3}, and so on till the matryoshka *a*_{imi} that isn't nested into any other matryoshka).

It is guaranteed that *m*_{1} + *m*_{2} + ... + *m*_{k} = *n*, the numbers of matryoshkas in all the chains are distinct, in each chain the numbers of matryoshkas follow in the ascending order.

Output

In the single line print the minimum number of seconds needed to assemble one large chain from the initial configuration.

Examples

Input

3 2

2 1 2

1 3

Output

1

Input

7 3

3 1 3 7

2 2 5

2 4 6

Output

10

Note

In the first sample test there are two chains: 1 → 2 and 3. In one second you can nest the first chain into the second one and get 1 → 2 → 3.

In the second sample test you need to disassemble all the three chains into individual matryoshkas in 2 + 1 + 1 = 4 seconds and then assemble one big chain in 6 seconds.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/16/2021 17:24:39 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|