#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
typedef long long ll;

int main()
{
	int n,k;
	scanf("%d%d", &n,&k);
	int d[k+1];
	int a[k+1][n+1];
	int i = 1;
	int j;
	int nlog[n+1];
	while (i <= n)
	{
		nlog[i] = i;
		i++;
	}
	i = 1;
	while (i <= k)
	{
		scanf("%d",&d[i]);
		j = 1;
		while (j <= d[i])
		{	
			scanf("%d",&a[i][j]);
			nlog[a[i][j]] = 0;
			j++;
		}
		i++;
	}
	i = 1;
	int cnt = 0;
	while (i <= n)
	{
		if (nlog[i] != 0)
			cnt++;
		i++;
	}
	printf("%d\n", cnt);
	return (0);
}
