#include<bits/stdc++.h>

#define int long long



using namespace std;



int n,m,ans;

queue<int> q;

vector<int> g[5010];

int rd[5010];

int cd[5010];

int cnt[5010];



inline int read(){

    int x=0;

    char c=getchar();

    while(c<'0'||c>'9') c=getchar();

    while(c>='0'&&c<='9'){

        x=(x<<3)+(x<<1)+c-48;

        c=getchar();

    }

    return x;

}



void topsort(){

    while(!q.empty()){

        int t=q.front();

        q.pop();

        for(int i=0;i<g[t].size();++i){

            int j=g[t][i];

            --rd[j];

            cnt[j]=(cnt[j]+cnt[t])%80112002;

            if(rd[j]==0) q.push(j);

        }

    }

    return;

}



signed main(){

    n=read();m=read();

    while(m--){

        int u=read(),v=read();

        g[u].push_back(v);

        rd[v]++;cd[u]++;

    }

    for(int i=1;i<=n;++i){

        if(rd[i]==0){

            q.push(i);

            cnt[i]=1;

        }

    }

    topsort();

    for(int i=1;i<=n;++i){

        if(cd[i]==0) ans=(ans+cnt[i])%80112002;

    }

    cout<<ans;

    return 0;

}