#include <iostream>
#include <stdio.h>

using namespace std;

int main()
{
	int N,K;
	cin >> N >> K ;
	int d[K+1];
	int A[K+1][N+1];
	int n[N] ;
	int i = 1;
	int j;
	while (i <= K)
	{
		n[i] = i;
		cin >> d[i];
		j = 1;
		while (j <= d[i])
		{
			cin >> A[i][j];
			n[A[i][j]] = -1;
			j++;
		}
		i++;
	}
	i = 1;
	int cnt = 0;
	while (i <= N)
	{
		if (n[i] != -1)
			cnt++;
		i++;
	}
	cout << cnt << endl;
	return 0;
}
