#include<bits/stdc++.h>
using namespace std;
void search(int);
struct tree{
int id;
string name;
int pid;
};
vector <tree> tr;
int ccc=0;
int main(){
int id,m;
cin>>id>>m;
for(int i=0;i<m;i++){
tree t;
cin>>t.id>>t.name>>t.pid;
tr.push_back(t);
}
//for(int i=0;i<tr.size();i++) cout<<tr[i].id<<","<<tr[i].name<<","<<tr[i].pid<<endl;
search(id);
ccc++;
cout<<ccc;
return 0;
}
void search(int pid){
for(int i=0;i<tr.size();i++){
if(tr[i].pid==pid){
ccc++;
search(tr[i].id);
}
}
}
题目出自c6c6.cc