#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;
//LLONG_MIN

//AC

int main(void){
	ll n,m,g,r,h,d[510]={},ans=0;
	cin>>n>>m;
	vector<ll> v[510];
	rep(i,m){
		cin>>g>>r;
		rep(j,r){
			cin>>h;
			v[h].push_back(g);
		}
		d[g]+=r;
	}
	queue<ll> Q;
	reg(i,1,n)if(d[i]==0)Q.push(i);
	while(!Q.empty()){
		ll p = Q.front();Q.pop();
		rep(i,v[p].size()){
			ll q = v[p][i];
			d[q]--;
			if(d[q]==0)Q.push(q);
		}
	}
	reg(i,1,n)if(d[i]==0)ans++;
	cout<<ans<<endl;
}