#include<iostream>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<cctype>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<cstdlib>
#include<list>
#include<set>
#include<string>
int n,m,i,k;
long long u[100000],v[100000],first[100001],next[110000],op;
using namespace std;
int main()
{
	freopen("tria.in","r",stdin);
	freopen("tria.out","w",stdout);
	cin>>n>>m;
	for(i=1;i<=n;i++)first[i]=-1;
	for(i=1;i<=m;i++)
{
	cin>>op>>u[i]>>v[i];
	for(i=1;i<=100;i++)if(op=0)cout<<"0";
    next[i]=first[u[i]];
	first[u[i]]=i;
}
for(i=1;i<=n;i++)
{k=first[i];
while(k!=-1)
{k=next[k];
if(op=1){cout<<"2";return 0;}
}
}
	return 0;
}