// Problem: P4017 最大食物鏈計數
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P4017
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// User: Pannnn

#include <bits/stdc++.h>

using namespace std;

template<class T>
void debugVector(const T &a) {
    cout << "[ ";
    for (size_t i = 0; i < a.size(); ++i) {
        cout << a[i] << (i == a.size() - 1 ? " " : ", ");
    }
    cout << "]" << endl;
}

template<class T1, class T2>
void debugVectorPair(const vector<pair<T1, T2>> &a) {
    cout << "{";
    for (size_t i = 0; i < a.size(); ++i) {
        cout << "[ " << a[i].first << ": " << a[i].second << (i == a.size() - 1 ? " ]" : " ], ");
    }
    cout << "}" << endl;
}


template<class T>
void debugMatrix2(const T &a) {
    for (size_t i = 0; i < a.size(); ++i) {
        debugVector(a[i]);
    }
}

template<class T>
using matrix2 = vector<vector<T>>;

template<class T>
vector<vector<T>> getMatrix2(size_t n, size_t m, T init = T()) {
    return vector<vector<T>>(n, vector<T>(m, init));
}

template<class T>
using matrix3 = vector<vector<vector<T>>>;

template<class T>
vector<vector<vector<T>>> getMatrix3(size_t x, size_t y, size_t z, T init = T()) {
    return vector<vector<vector<T>>>(x, vector<vector<T>>(y, vector<T>(z, init)));
}

vector<int> genBigInteger(const string &a) {
    vector<int> res;
    if (a.empty()) return res;
    for (int i = a.size() - 1; i >= 0; --i) {
        res.push_back(a[i] - '0');
    }
    return res;
}

ostream &printBigInteger(const vector<int> &a) {
    if (a.empty()) return cout;
    for (int i = a.size() - 1; i >= 0; --i) {
        cout << a[i];
    }
    return cout;
}

vector<int> maxBigInteger(const vector<int> &a, const vector<int> &b) {
    if (a.size() > b.size()) {
        return a;
    } else if (a.size() < b.size()) {
        return b;
    }
    for (int i = a.size() - 1; i >= 0; --i) {
        if (a[i] > b[i]) {
            return a;
        } else if (a[i] < b[i]) {
            return b;
        }
    }
    return a;
}

vector<int> addBigInteger(const vector<int> &a, const vector<int> &b) {
    vector<int> res;
    int pre = 0;
    for (size_t i = 0; i < a.size() || i < b.size() || pre; ++i) {
        if (i < a.size()) pre += a[i];
        if (i < b.size()) pre += b[i];
        res.push_back(pre % 10);
        pre /= 10;
    }
    while (res.size() > 1 && res.back() == 0) {
        res.pop_back();
    }
    return res;
}

vector<int> mulBigInteger(const vector<int> &a, int b) {
    vector<int> res;
    int pre = 0;
    for (size_t i = 0; i < a.size() || pre; ++i) {
        if (i < a.size()) pre += a[i] * b;
        res.push_back(pre % 10);
        pre /= 10;
    }
    while (res.size() > 1 && res.back() == 0) {
        res.pop_back();
    }
    return res;
}

vector<int> divBigInteger(const vector<int> &a, int b, int &r) {
    vector<int> res;
    for (int i = a.size() - 1; i >= 0; --i) {
        r = 10 * r + a[i];
        res.push_back(r / b);
        r %= b;
    }
    reverse(res.begin(), res.end());
    while (res.size() > 1 && res.back() == 0) {
        res.pop_back();
    }
    return res;
}

vector<int> getQue(int n, vector<int> inDegree, matrix2<int> &path) {
    vector<int> que;
    for (int i = 1; i <= n; ++i) {
        if (inDegree[i] == 0) {
            que.push_back(i);
        }
    }
    
    for (int i = 0; i < que.size(); ++i) {
        for (int j = 0; j < path[que[i]].size(); ++j) {
            --inDegree[path[que[i]][j]];
            if (inDegree[path[que[i]][j]] == 0) {
                que.push_back(path[que[i]][j]);
            }
        }
    }
    return que;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m;
    cin >> n >> m;
    matrix2<int> path = getMatrix2(n + 1, 0, 0);
    
    vector<int> inDegree(n + 1);
    vector<int> outDegree(n + 1);
    int a, b;
    for (int i = 0; i < m; ++i) {
        cin >> a >> b;
        path[a].push_back(b);
        ++inDegree[b];
        ++outDegree[a];
    }
    
    vector<int> que = getQue(n, inDegree, path);
    // res[i] 以生產者開始，以i結尾的食物鏈條數
    vector<int> res(n + 1);
    
    for (int i = 1; i <= n; ++i) {
        if (inDegree[i] == 0) {
            res[i] = 1;
        }
    }
    for (int i = 0; i < que.size(); ++i) {
        for (int j = 0; j < path[que[i]].size(); ++j) {
            res[path[que[i]][j]] += res[que[i]];
            res[path[que[i]][j]] %= 80112002;
        }
    }
    
    int cnt = 0;
    for (int i = 1; i <= n; ++i) {
        if (outDegree[i] == 0) {
            cnt += res[i];
            cnt %= 80112002;
        }
    }
    cout << cnt << endl;
    return 0;
}