#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define db double

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> out(n + 1);
    vector<int> bel(n + 1), pos(n + 1), in(n + 1), vis(n + 1);
    vector<vector<int>> chain;
    queue<int> q;
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        out[a].pb(b);
        in[b]++;
    }
    for (int i = 1; i <= n; i++) {
        if (in[i] == 0) {
            q.push(i);
        }
    }
    while (q.size()) {
        int x = q.front();
        q.pop();
        if (vis[x]) continue;
        vector<int> tmp;
        while (1) {
            vis[x] = 1;
            bel[x] = chain.size();
            pos[x] = tmp.size();
            tmp.pb(x);
            for (int y : out[x]) {
                if (--in[y] == 0) q.push(y);
            }
            int z = -1;
            for (int y : out[x]) {
                if (!vis[y]) {
                    z = y;
                    break;
                }
            }
            if (z == -1) break;
            x = z;
        }
        chain.pb(tmp);
    }
    constexpr int inf = 1e9;
    vector dp(n + 1, vector(chain.size(), inf));
    function<void(int)> dfs = [&](int x) -> void {
        if (dp[x][0] != inf) return;
        dp[x][bel[x]] = pos[x];
        for (int y : out[x]) {
            if (bel[x] == bel[y]) continue;
            dfs(y);
            for (int i = 0; i < chain.size(); i++) {
                dp[x][i] = min(dp[x][i], dp[y][i]);
            }
        }
    };
    for (int i = 1; i <= n; i++) {
        dfs(i);
        int ans = 0;
        for (int j = 0; j < chain.size(); j++) {
            ans += max(0, (int)chain[j].size() - dp[i][j]);
        }
        cout << ans << " \n"[i==n];
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    srand(time(0));
    int t = 1;
    // cin>>t;
    while (t--) solve();
    return 0;
}