#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
vector<int> pic[5010];
queue<int> q;
int a[5010],in[5010],out[5010];
int main(){ 
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int x,y;
		cin>>x>>y;
		out[x]++;
		in[y]++;
		pic[x].push_back(y);
	}
	memset(a,0,sizeof(a));
	for(int i=1;i<=n;i++){
		if(in[i]==0){
			q.push(i);
			a[i]=1;
		}
	}
	while(!q.empty()){
		int x=q.front();
		q.pop();
		for(int i=1,s=pic[x].size();i<s;i++){
			int y=pic[x][i];
			a[y]=(a[x]+a[y])%80112002;
			in[y]--;
			if(in[y]==0)
			    q.push(y);
		}
	}
	for(int i=1;i<=n;i++){
		if(out[i]==0)
		    ans=(ans+a[i])%80112002;
	}
	cout<<ans;
	return 0;
}