#include<bits/stdc++.h>

using namespace std;

mt19937 rnd(time(0));
int const maxn = 7005;
vector < int > g[maxn], G[maxn], ts, go[maxn], res[2 * maxn];
int used[2 * maxn], cmp, numb[maxn], bad;
vector < int > in[maxn];
bitset < maxn > Gz[maxn];
int one[maxn], two[maxn], out[maxn];
bitset < maxn > free_righ, USED;

void answer(int v, int mx, int cmp) {
    used[v] = bad;
    if (v <= cmp) {
        for (auto key : in[v]) out[key] = mx;
    }
    for (auto key : res[v]) {
        if (used[key] != bad) answer(key, mx, cmp);
    }
}

void dfs1(int v) {
    used[v] = 2, numb[v] = cmp, in[cmp].push_back(v);
    for (auto u : g[v]) {
        if (used[u] == 1) {
            dfs1(u);
        } else if (numb[u] != cmp) {
            go[cmp].push_back(numb[u]);
        }
    }
}

void dfs(int v) {
    used[v] = 1;
    for (auto u : G[v]) if (!used[u]) dfs(u);
    ts.push_back(v);
}

void dfs2(int v, int start) {
    used[v] = bad;
    if (v != start) Gz[start][v] = 1;
    for (auto u : go[v]) {
        if (used[u] != bad) dfs2(u, start);
    }
}

bool calc(int v) {
    used[v] = bad;
    int pos = (Gz[v]&free_righ)._Find_first();
    if (pos <= cmp) {
        one[v] = pos, two[pos] = v, free_righ[pos] = 0;
        return true;
    }
    for (int u = Gz[v]._Find_first(); u <= cmp; u = Gz[v]._Find_next(u)) {
        if (used[two[u]] != bad && calc(two[u])) {
            one[v] = u, two[u] = v;
            return true;
        }
    }
    return false;
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m, u, v;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> u >> v;
        g[u].push_back(v);
        G[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) if (!used[i]) dfs(i);
    reverse(ts.begin(), ts.end());
    for (auto key : ts) {
        if (used[key] != 2) {
            cmp++;
            dfs1(key);
        }
    }
    bad = 2;
    for (int i = 1; i <= cmp; i++) {
        bad++;
        dfs2(i, i);
    }
    int find = 1;
    for (int i = 1; i <= cmp; i++) free_righ[i] = 1;
    vector < int > Q;
    for (int i = 1; i <= cmp; i++) {
        Q.push_back(i);
    }
    shuffle(Q.begin(), Q.end(), rnd);
    for (auto i : Q) {
        for (auto j : Q) {
            if (Gz[i][j] && !one[i] && !two[j]) {
                one[i] = j, two[j] = i, free_righ[j] = 0;
            }
        }
    }
    while (find) {
        find = 0;
        bad++;
        for (auto i : Q) {
            if (used[i] != bad && !one[i] && calc(i)) {
                find = 1;
            }
        }
    }
    int mx = 0;
    bad++;
    for (int i = 1; i <= cmp; i++) {
        if (one[i]) res[i].push_back(one[i] + cmp), res[one[i] + cmp].push_back(i);
        res[i].push_back(i + cmp), res[i + cmp].push_back(i);
    }
    for (int i = 1; i <= cmp; i++) {
        if (used[i] != bad) {
            mx++;
            answer(i, mx, cmp);
        }
    }
    for (int i = 1; i <= n; i++) cout << out[i] << " ";
    cout << '\n';
    return 0;
}