CodeForces

Andrewid 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⁵) and k (1 ≤ k ≤ 10⁵) — 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₁ + m₂ + ... + 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.

题目大意：

给你1..n这n个数构成的k个序列。每次操作可以把长度为k(k>=2)的序列分为 前k-1 和 最后一个数 两个序列，或者将一个数的序列缀在另一个序列之后。

求最少多少次操作，使得序列变为123...n？

找出最大的i，使得1..i在原始某一序列前缀处。

#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>

using namespace std;

const int maxn=100000;

int mat[maxn+5];
int m[maxn+5][2];

int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    m[0][1]=0;
    for(int i=1,mi;i<=k;i++)
    {
        scanf("%d",&mi);
        m[i][0]=m[i-1][1]+1;
        m[i][1]=m[i][0]+mi-1;
        for(int j=m[i][0];j<=m[i][1];j++)
            scanf("%d",mat+j);
    }

    int a=0,b=0;
    for(int i=1;i<=k;i++)
    {
        int st=m[i][0];
        int en=m[i][1];
        int j=st;
        for(;j<=en;j++)
        {
            if(mat[j]==j-st+1)
                a++;
            else
                break;
        }
        for(;j<=en;j++)
            b++;
        if(mat[st]!=1)
            b--;
    }

    printf("%d
",b+n-a);
    return 0;
}