#include<bits/stdc++.h>
#define maxn 7005
std::vector<int> G[maxn];
int col[maxn];
int dfn[maxn],low[maxn],cnt, cntcol;
int top, sta[maxn];
bool in[maxn];
void dfs(int u) {
    dfn[u] = low[u] = ++cnt;
    sta[++top] = u;
    in[u] = 1;
    for(auto i : G[u]) {
        if (!dfn[i]) dfs(i), low[u] = std::min(low[u], low[i]);
        else if (in[i]) low[u] = std::min(low[u],dfn[i]);
    }
    if (low[u] == dfn[u]) {
        ++cntcol;
        int v;
        do{
            v = sta[top--];
            col[v] = cntcol;
            in[v] = 0;
        }while(v != u);
    }
}

namespace Flow {
    #define maxm (7005 * 8)
    int S, T;
    int totv,tote = 1;
    int fir[maxn << 1],to[maxm], nxt[maxm], w[maxm];
    void addedge(int u,int v,int val) {
        // std::cout << u << " " << v << " " << val << std::endl;
        to[++tote] = v, nxt[tote] = fir[u], fir[u] = tote, w[tote] = val;
        to[++tote] = u, nxt[tote] = fir[v], fir[v] = tote, w[tote] = 0;
    }
    int dis[maxn << 1],q[maxn << 1];
    bool bfs() {
        int l = 1, r = 0;
        memset(dis, 0, sizeof dis);
        dis[q[++r] = S] = 1;
        while (l <= r) {
            int u = q[l++];
            for(int i = fir[u];i;i = nxt[i]) if (w[i] && !dis[to[i]]) {
                dis[q[++r] = to[i]] = dis[u] + 1;
                if (to[i] == T) return 1;
            }
        }
        return 0;
    }
    int cur[maxn << 1];
    int dfs(int u,int flow) {
        if (u == T || !flow) return flow;
        int nowf = flow;
        // std::cout << u << std::endl;
        for(int &i = cur[u]; i; i = nxt[i]) {
            if (w[i] && dis[to[i]] == dis[u] + 1) {
                int f = dfs(to[i], std::min(nowf, w[i]));
                w[i] -= f, w[i ^ 1] += f;
                if (!(nowf -= f)) return flow;
            }
        }
        return flow - nowf;
    }
    int dinic() {
        int res = 0, f;
        while(bfs()) {
            // std::cout << dis[T] << std::endl;
            memcpy(cur, fir, sizeof(fir));
            while(f = dfs(S, 1e9)) {
                // std::cout << f << std::endl;
                res += f;
            }
        }
        return res;
    }
    int pre[maxn << 1];
    bool BFS() {
        int l = 1, r = 0;
        memset(dis, 0, sizeof dis);
        dis[q[++r] = S] = 1;
        while (l <= r) {
            int u = q[l++];
            for(int i = fir[u];i;i = nxt[i]) if (i % 2 == 0 && w[i] && !dis[to[i]]) {
                dis[q[++r] = to[i]] = dis[u] + 1;
                pre[to[i]] = u;
                if (to[i] == T) return 1;
            }
        }
        return 0;
    }

    std::vector< std::pair<int,int> >  find(int Ans) {
        for(int i = 2; i <= tote; i += 2) {
            w[i] = w[i ^ 1];
        }
        std::vector< std::pair<int,int> > vec;
        while (BFS()) {
            
            std::pair<int,int> ans;
            for(int u = T; u; u = pre[u]) {
                int v = pre[u];
                for(int i = fir[v]; i; i = nxt[i]) if (to[i] == u && i % 2 == 0 && w[i]) {
                    w[i] --;
                }
                if (u == T) {
                    ans.second = v;
                }
                if (v == S) {
                    ans.first = u;
                }
            }
            vec.push_back(ans);
        }
        assert(vec.size() == Ans);
        return vec;
        
    }
}
int Res[maxn];
int ind[maxn];
int pr[maxn];
void print(std::vector< std::pair<int,int> > vec) {
    
    for(auto i : vec) {
        int u = i.first, v = i.second - cntcol;
        pr[u] = v;
        ind[v]++;
    }
    int totc = 0;
    for(int i = 1; i <= cntcol; i++) {
        if (ind[i] == 0) {
            totc++;
            for(int j = i; j; j = pr[j]) {
                Res[j] = totc;
            }
        }
    }
}
int main() {
    // freopen("in.txt","r",stdin);
    int n, m;
    std::cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x,y;
        std::cin >> x >> y;
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; i++) if (!dfn[i]) {
        dfs(i);
    }
    // for(int i = 1; i <= n; i++) {
    //     std::cout << col[i] << std::endl;
    // }
    int S = 2 * cntcol + 1, T = 2 * cntcol + 2;
    std::set< std::pair<int,int> > st;
    for(int i = 1; i <= cntcol; i++) {
        Flow::addedge(S, i, 1), Flow::addedge(i + cntcol, T, 1);
        Flow::addedge(i + cntcol, i , 1e9);
    }
    for(int i = 1; i <= n; i++) {
        for(auto j : G[i]) if (col[i] != col[j]) {
            if (st.find({col[i],col[j]}) == st.end()) {
                st.insert({col[i],col[j]});
                // std::cout << col[i] << " " << col[j] << std::endl;
                Flow::addedge(col[i], col[j] + cntcol, 1e9);
            }
        }
    }
    Flow::S = S,Flow::T = T;
    int F = Flow::dinic();
    // std::cout << F << std::endl;
    auto pir = Flow::find(F);
    print(pir);
    for(int i = 1; i <= n; i++) {
        std::cout << Res[col[i]] << " ";
    }
    std::cout << std::endl;
}