Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds. Codesorfes has rounds of two types: Div 1 (for advanced coders) and Div 2 (for beginner coders). Two rounds, Div 1 and Div 2 , can go simultaneously, ( Div 1 round cannot be held without Div 2 ) in all other cases the rounds don't overlap in time. Each round has a unique identifier — a positive integer. The rounds are sequentially (without gaps) numbered with identifiers by the starting time of the round. The identifiers of rounds that are run simultaneously are different by one, also the identifier of the Div 1 round is always greater. Sereja is a beginner coder, so he can take part only in rounds of Div 2 type. At the moment he is taking part in a Div 2 round, its identifier equals to x . Sereja remembers very well that he has taken part in exactly k rounds before this round. Also, he remembers all identifiers of the rounds he has taken part in and all identifiers of the rounds that went simultaneously with them. Sereja doesn't remember anything about the rounds he missed. Sereja is wondering: what minimum and what maximum number of Div 2 rounds could he have missed? Help him find these two numbers. The first line contains two integers: x (1 ≤ x ≤ 4000) — the round Sereja is taking part in today, and k (0 ≤ k < 4000) — the number of rounds he took part in. Next k lines contain the descriptions of the rounds that Sereja took part in before. If Sereja took part in one of two simultaneous rounds, the corresponding line looks like: "1 num 2 num 1 " (where num 2 is the identifier of this Div 2 round, num 1 is the identifier of the Div 1 round). It is guaranteed that num 1 - num 2 = 1 . If Sereja took part in a usual Div 2 round, then the corresponding line looks like: "2 num " (where num is the identifier of this Div 2 round). It is guaranteed that the identifiers of all given rounds are less than x . Prin