#include "bits/stdc++.h"
using namespace std;
typedef std::pair<int, int> pii;
void umin(int &a, int t) {
    if (t < a) a = t;
}
const int MAXN = 20011;
set<pii> S;
struct edge {
    int v, nxt;
} e[MAXN << 1 | 1];
int cnt = 1, last[MAXN];
void adde(int u, int v) { e[++cnt].v = v, e[cnt].nxt = last[u], last[u] = cnt; }

int dfn[MAXN], low[MAXN], cur = 0;
int s[MAXN], top = 0;
vector<int> seq[MAXN];
int scc[MAXN], scnt = 0;
bool ins[MAXN];
void tarjan(int u) {
    dfn[u] = low[u] = ++cur;
    s[++top] = u, ins[u] = 1;
    for (int i = last[u]; i; i = e[i].nxt) {
        int v = e[i].v;
        if (!dfn[v])
            tarjan(v), umin(low[u], low[v]);
        else if (ins[v])
            umin(low[u], dfn[v]);
    }
    if (dfn[u] == low[u]) {
        ++scnt;
        while (1) {
            int x = s[top--];
            seq[scnt].emplace_back(x);
            scc[x] = scnt;
            ins[x] = 0;
            if (x == u) break;
        }
    }
}
vector<int> g[MAXN], h[MAXN];
int match[MAXN];
bool vis[MAXN];
bool dfs(int u) {
    for (auto v : g[u])
        if (!vis[v]) {
            vis[v] = 1;
            if (!match[v] || dfs(match[v])) {
                match[v] = u;
                return 1;
            }
        }
    return 0;
}
int color[MAXN], cc = 0;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        adde(u, v);
    }
    for (int u = 1; u <= n; ++u)
        if (!dfn[u]) tarjan(u);
    for (int u = 1; u <= n; ++u)
        for (int i = last[u]; i; i = e[i].nxt) {
            int v = e[i].v, p = scc[u], q = scc[v];
            if (p != q && !S.count(pii(p, q)) && !S.count(pii(q, p))) S.insert(pii(p, q)), g[p].emplace_back(q);
            // if (scc[u] != scc[v]) g[scc[u]].emplace_back(scc[v]); //, printf("add %d %d\n", scc[u], scc[v]);
        }
    // for (int u = 1; u <= n; ++u)
    // printf("scc[%d]=%d\n", u, scc[u]);
    int ans = 0;
    for (int u = 1; u <= scnt; ++u) {
        for (int i = 1; i <= scnt; ++i)
            vis[i] = 0;
        ans += dfs(u);
    }
    cerr << "ans=" << scnt - ans << '\n';
    // cout << scnt - ans << "\n";
    //  for (int u = 1; u <= scnt; ++u)
    //      printf("Match[%d]=%d\n", u, match[u]);
    for (int u = 1; u <= scnt; ++u)
        if (!color[seq[u][0]]) {
            ++cc;
            int p = u;
            while (p) {
                // printf("p=%d:", p);
                for (auto x : seq[p])
                    color[x] = cc; //, printf("color[%d]=%d\n", x, color[x]);
                p = match[p];
            }
        }
    for (int u = 1; u <= n; ++u)
        cout << color[u] << " ";
    cout << '\n';
    return 0;
}