#include <bits/stdc++.h>

#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

int mod = 998244353;

struct mint {
    int value = 0;

    constexpr mint() : value() {}

    mint(const long &x) {
        value = normalize(x);
    }

    static long normalize(const long &x) {
        long v = x % mod;
        if (v < 0) v += mod;
        return v;
    }

    bool operator==(const mint &x) { return value == x.value; };

    mint operator+(const mint &x) { return value + x.value; };

    mint operator-(const mint &x) { return value - x.value; };

    mint operator*(const mint &x) { return (long) value * x.value; };

    void operator+=(const mint &x) { value = normalize(value + x.value); };

    void operator-=(const mint &x) { value = normalize(value - x.value); };
};

mint power(mint a, long b) {
    mint res = 1;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
        }
        a = a * a;
        b >>= 1;
    }
    return res;
}

mint inv(mint a) {
    return power(a, mod - 2);
}

int main() {
    ios::sync_with_stdio(false);

    int n, m;
    cin >> n >> m;
    vector<vector<int>> g(n);
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        g[x].push_back(y);
    }
    vector<vector<pair<int, int>>> pos(n);
    vector<vector<int>> p;
    auto gg = g;
    for (int i = 0; i < n; i++) {
        while (!gg[i].empty()) {
            int x = i;
            p.push_back({x});
            int t = p.size() - 1;
            pos[x].push_back({t, 0});
            while (!gg[x].empty()) {
                int y = gg[x].back();
                gg[x].pop_back();
                x = y;
                pos[x].push_back({t, p.back().size()});
                p.back().push_back(x);
            }
        }
    }
    int k = p.size();
    vector<vector<mint>> ps(k);
    for (int i = 0; i < k; i++) {
        int t = p[i].size();
        ps[i].resize(t + 1);
        for (int j = t - 1; j >= 0; j--) {
            int x = p[i][j];
            ps[i][j] = ps[i][j + 1] + inv(pos[x].size());
        }
    }

    vector<mint> res(n);

    for (int i = 0; i < k; i++) {
        vector<int> d(n);
        for (int x = n - 1; x >= 0; x--) {
            d[x] = p[i].size();
            for (auto [a, b]: pos[x]) {
                if (a == i) d[x] = b;
            }
            for (auto y: g[x]) {
                d[x] = min(d[x], d[y]);
            }
            res[x] += ps[i][d[x]];
        }
    }

    for (int i = 0; i < n; i++) {
        if (res[i] == 0) res[i] = 1;
        cout << res[i].value << "\n";
    }

    return 0;
}