#include<bits/stdc++.h>
using namespace std;
const int MAXN = 7010;
int n,m,match[MAXN],cnt;
vector<int> e[MAXN];

bitset<MAXN> to[MAXN];
int qu[MAXN*2],hd,rr,pre[MAXN*2];
bitset<MAXN> f[MAXN],vis,tmp[MAXN];

int dfs(int u){
    tmp[u] = f[u] & vis;
    for(int v = tmp[u]._Find_first();v<=n;v=tmp[u]._Find_next(v)){
        vis[v] = 0;
        if(!match[v])return match[v] = u;
        else if(dfs(match[v]))return match[v] = u;
        tmp[u] &= vis;
    }
    return 0;
}

int fa[MAXN],ans[MAXN],col;
int find(int x){return (fa[x]==x)?x:(fa[x]=find(fa[x]));}

int main(){
    //freopen("color.in","r",stdin); freopen("color.out","w",stdout);
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>n>>m;
    for(int i=1,u,v;i<=m;i++){
        cin>>u>>v;
        e[u].push_back(v);
    }
    iota(fa+1,fa+1+n,1);
    for(int i=1;i<=n;i++){
        to[i][i] = 1; hd = rr = 0; qu[rr++] = i;
        while(hd<rr){
            int u = qu[hd++];
            for(auto v : e[u])if(!to[i][v]){
                to[i][v] = 1;
                qu[rr++] = v;
            }
        }
    }
    for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++){
        if(to[i][j] && to[j][i])f[i][j] = 1;
        else if(to[i][j])f[i][j] = 1;
        else if(to[j][i])f[j][i] = 1;
    }
    //
    for(int i=1;i<=n;i++){
        vis.set();
        hd = rr = 0; memset(pre,0,sizeof pre); qu[rr++] = i;
        int to = -1;
        while(hd<rr){
            int u = qu[hd++];
            if(u<=n){
                tmp[u] = f[u] & vis;
                for(int v=tmp[u]._Find_first();v<=n;v=tmp[u]._Find_next(v)){
                    vis[v] = 0; pre[v+n] = u;
                    if(!match[v]){
                        to = v+n;
                        goto END;
                    }else qu[rr++] = v+n;
                }
            }else qu[rr++] = match[u-n],assert(match[u-n]),pre[match[u-n]] = u;
        }
        END:;
        if(to != -1){
            for(;to;to=pre[to])if(to > n)match[to-n] = pre[to];
            cnt++;
        }
    }
    for(int i=1;i<=n;i++)if(match[i])fa[find(i)] = find(match[i]);
    for(int i=1;i<=n;i++)if(find(i)==i)ans[i] = ++col;
    for(int i=1;i<=n;i++)ans[i] = ans[find(i)];
    //
    for(int i=1;i<=n;i++)cout<<ans[i]<<" ";

    return 0;
}