#include<bits/stdc++.h>
using namespace std;
bool stmemory;
namespace Call_me_Eric{
inline int read(){
    int x = 0, f = 1;char ch = getchar();
    while(ch < '0' || ch > '9'){if(ch == '-') f = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9'){x = (x << 1) + (x << 3) + (ch ^ 48);ch = getchar();}
    return x * f;
}

const int maxn = 2e4 + 10,maxm = 8e4 + 10, INF = 0x3f3f3f3f;
int n, m;
struct edge1{
    int u, v, l, r;
    edge1(int u = 0,int v = 0,int l = 0,int r = 0):u(u),v(v),l(l),r(r){}
};
vector<pair<int,int> > ed[maxn];
int revin[maxn], revout[maxn];
namespace Dinic{
    const int maxn = 4e4 + 10;
    int total = 0;
    int head[maxn], tot = 1;
    struct edge{
        int to, nexte, cap, flow;
        edge(int to = 0,int ne = 0,int ca = 0,int fl = 0):to(to),nexte(ne),cap(ca),flow(fl){}
    }e[maxm * 2];
    void add(int u,int v,int cap){e[++tot] = edge(v,head[u],cap);head[u] = tot;}
    void addd(int u,int v,int cap){add(u,v,cap);add(v, u, 0);}

    int dep[maxn], cur[maxn];
    int dfs(int u,int flow,int T){
        // printf("%lld\n",u);
        if(u == T)return flow;
        int rest = 0, tmp = 0;
        for(int i = cur[u];i && flow;i = e[i].nexte){
            cur[u] = i; int v = e[i].to;
            if(e[i].cap - e[i].flow > 0 && (dep[v] == dep[u] + 1)){
                tmp = dfs(v,min(flow,e[i].cap - e[i].flow),T);
                if(tmp == 0)dep[v] = INF;
                e[i].flow += tmp; e[i ^ 1].flow -= tmp;
                flow -= tmp;rest += tmp;
                if(!flow)return rest;
            }
        }
        return rest;
    }
    bool bfs(int S,int T){
        queue<int> que;
        for(int i = 1;i <= total;i++){dep[i] = INF;cur[i] = 0;}
        que.push(S);dep[S] = 1; cur[S] = head[S];
        while(!que.empty()){
            int u = que.front(); que.pop();
            for(int i = head[u];i;i = e[i].nexte){
                int v = e[i].to;
                if(e[i].cap - e[i].flow > 0 && dep[v] == INF){
                    que.push(v);
                    cur[v] = head[v];
                    dep[v] = dep[u] + 1;
                    if(v == T)return 1;
                }
            }
        }
        return 0;
    }
    int Dinic(int S,int T){
        int mxflow = 0;
        while(bfs(S,T)){mxflow += dfs(S,INF,T);}
        return mxflow;
    }
    int in[maxn], out[maxn];
    int solve(vector<edge1> edgs,int S,int T,int ttt){
        total = ttt;int S1 = ++total;int T1 = ++total;
        for(edge1 edg : edgs){
            int u = edg.u, v = edg.v, l = edg.l, r = edg.r;
            in[v] += l;out[u] += l;addd(u, v, r - l);
        }
        int sum = 0;
        for(int i = 1;i <= total - 2;i++){
            if(in[i] > out[i]){addd(S1,i,in[i] - out[i]);sum += (in[i] - out[i]);}
            if(in[i] < out[i])addd(i,T1,out[i] - in[i]);
        }
        addd(T,S,INF);int pos = tot;
        int tmpp = Dinic(S1,T1);int res = e[pos ^ 1].flow;
        e[pos].flow = e[pos].cap;e[pos ^ 1].flow = e[pos ^ 1].cap;
        // for(int i = 1;i <= tot;i ++){
        //     cerr << "u = " << e[i ^ 1].to << " v = " << e[i].to << " cap = " << e[i].cap << " flow = " << e[i].flow << endl;
        //     // cerr << e[i ^ 1].to << " " << e[i].to << endl;
        // }
        int tmp = Dinic(T,S);
        cerr << "res = " << res << " tmp = " << tmp << endl;
        cerr << "dert = " << res - tmp << endl;
        for(int i = 2;i <= tot - 2;i += 2){
            int u = e[i ^ 1].to, v = e[i].to, rest = e[i].flow;
            if(revin[u] == revout[v])rest++;
            if(v <= total - 2 && v != S)ed[u].emplace_back(v, rest);
        }
        return res - tmp;
    }
};

vector<int> edg[maxn];
int dfn[maxn], low[maxn], idx;
bool book[maxn];stack<int> stk;
int color, col[maxn];vector<int> scc[maxn];
void Tarjan(int u){
    dfn[u] = low[u] = ++idx;
    stk.push(u);book[u] = 1;
    for(int v : edg[u]){
        if(!dfn[v]){Tarjan(v);low[u] = min(low[u], low[v]);}
        else if(book[v]){low[u] = min(low[u],dfn[v]);}
    }
    if(dfn[u] == low[u]){
        color++;int v = stk.top();
        do{
            v = stk.top();stk.pop();
            col[v] = color;
            scc[color].emplace_back(v);
            book[v] = 0;
        }while(v != u);
    }
}

vector<int> e[maxn];
int in[maxn], out[maxn];

int c[maxn];
void dfs(int u,int col,int T){
    // cerr << "u = " << u << " col = " << col << endl;
    if(u == T)return;if(revin[u] > 0) c[revin[u]] = col;
    for(auto &i : ed[u])if(i.second){dfs(i.first, col,T);i.second--;return;}
}


void main(){
    n = read(); m = read();
    for(int i = 1;i <= m;i++){
        int u, v;
        u = read(); v = read();
        edg[u].emplace_back(v);
    }
    for(int i = 1;i <= n;i++)if(!dfn[i])Tarjan(i);
    for(int u = 1;u <= n;u++)for(int v : edg[u]){
        if(col[v] != col[u])e[col[u]].emplace_back(col[v]);
    }

    int total = 0;int S = ++total;int T = ++total;total += 2;
    for(int i = 1;i <= 2;i++)revin[i] = -i,revout[i] = -i - 10;
    for(int i = 1;i <= color;i++){in[i] = ++total;out[i] = ++total;revin[in[i]] = revout[out[i]] = i;}
    for(int i = 1;i <= total;i++){if(revin[i] == 0)revin[i] = -i - 30;if(revout[i] == 0)revout[i] = -i - total - 10;}
    vector<edge1> edgs;
    for(int i = 1;i <= color;i++){
        sort(e[i].begin(),e[i].end());e[i].erase(unique(e[i].begin(),e[i].end()),e[i].end());
        for(int v : e[i])edgs.emplace_back(out[i],in[v],0, INF);
    }
    for(int i = 1;i <= color;i++){
        edgs.emplace_back(S,in[i],0,1); edgs.emplace_back(out[i],T,0,1);
        edgs.emplace_back(in[i],out[i],1,INF);
    }
    // cerr << "incnt = " << incnt << " outcnt = " << outcnt << endl;
    int res = Dinic::solve(edgs,S,T,total);
    
    // for(int u = 1;u <= total;u++){
    //     for(auto i : ed[u]){
    //         int v = i.first, w = i.second;
    //         cerr << "u = " << u << " v = " << v << " w = " << w << endl;
    //     }
    //     cerr << "revin = " << revin[u] << " revout = " << revout[u] << endl;
    // }
    for(int i = 1;i <= res;i++)dfs(S,i,T);

    for(int i = 1;i <= n;i++)printf("%d ",c[col[i]]);
    puts("");
    return;
}
};
bool edmemory;
signed main(){
    auto stclock = clock();
    Call_me_Eric::main();
    auto edclock = clock();
    cerr << (&stmemory - &edmemory) / 1024.0 / 1024.0 << " Mib cost.\n";
    cerr << (edclock - stclock) * 1.0 / CLOCKS_PER_SEC << " Sec cost.\n";
    return 0;
}