#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod= 1e10;

int N,M;
vector<int> edge[510];
int R[510], cnt[510];
int main(){
    cin>>N>>M;
    queue<int> q;
    REP(i,0,M){
        int g;
        cin>>g;
        g--;
        cin>>R[g];
        REP(j,0,R[g]){
            int h;
            cin>>h;
            h--;
            edge[h].push_back(g);
        }
    }
    int ans=0;
    REP(i,0,N) if(R[i]==0) q.push(i);
    while(!q.empty()){
        int from = q.front();
        q.pop();
        ans++;
        for(auto to:edge[from]){
            cnt[to]++;
            if(cnt[to]==R[to]) q.push(to);
        }
    }
    p(ans);
    return 0;
}