#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5,INF=1<<29;
int n,m,dfn[N],low[N],dcnt,st[N],in[N],top,id[N],num;
vector<int> G[N];
void dfs(int u){
    dfn[u]=low[u]=++dcnt;st[++top]=u;in[u]=1;
    for(int v:G[u]){
        if(!dfn[v])dfs(v),low[u]=min(low[u],low[v]);
        else if(in[v])low[u]=min(low[u],dfn[v]);
    }
    if(dfn[u]==low[u]){
        ++num;int y;
        do id[y=st[top--]]=num,in[y]=0; while(y!=u);
    }
}
map<int,int> mp[N];
int s,t,head[N],nxt[N],ver[N],val[N],tot=1,now[N],dep[N];
void add(int u,int v,int w){
    ver[++tot]=v;val[tot]=w;nxt[tot]=head[u];head[u]=tot;
    ver[++tot]=u;val[tot]=0;nxt[tot]=head[v];head[v]=tot;
}
bool bfs(){
    for(int i=1;i<=t;i++)now[i]=head[i],dep[i]=0;
    dep[s]=1;queue<int> Q;Q.push(s);
    while(!Q.empty()){
        int u=Q.front();Q.pop();
        for(int i=head[u],v;i;i=nxt[i])
            if(val[i]&&!dep[v=ver[i]]){
                dep[v]=dep[u]+1,Q.push(v);
                if(v==t)return true;
            }
    }
    return false;
}
int dfs(int u,int flow){
    if(u==t)return flow;
    int i,v,rest=flow;
    for(i=now[u];i;i=nxt[i])
        if(val[i]&&dep[v=ver[i]]==dep[u]+1){
            int d=dfs(v,min(rest,val[i]));if(!d)dep[v]=0;
            val[i]-=d,val[i^1]+=d,rest-=d;if(!rest)break;
        }
    now[u]=i;return flow-rest;
}
int dinic(){
    int maxflow=0;
    while(bfs())maxflow+=dfs(s,INF);
    return maxflow;
}
int cnt,pos1[N],pos2[N],pos3[N],to[N],col[N],ans;
vector<int> buc[N];
int main(){
    // freopen("color.in","r",stdin);
    // freopen("color.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1,u,v;i<=m;i++)
        scanf("%d%d",&u,&v),G[u].push_back(v);
    for(int i=1;i<=n;i++)if(!dfn[i])dfs(i);
    s=2*num+1;t=s+1;
    for(int i=1;i<=n;i++)for(int j:G[i]){
        int u=id[i],v=id[j];if(u<v)swap(u,v);
        if(u==v||mp[u][v])continue;mp[u][v]=++cnt;
    }
    for(int i=1;i<=num;i++)add(s,i,1),pos3[i]=tot;
    for(int i=num;i>=1;i--)
        for(auto e:mp[i]){
            int j=e.first,w=e.second;
            add(i,j,INF);pos1[w]=tot;
            add(i,j+num,INF);pos2[w]=tot;
        }
    for(int i=1;i<=num;i++)add(i+num,t,1);
    dinic();
    for(int i=num;i>=1;i--){
        if(val[pos3[i]])buc[i].push_back(i);
        for(auto e:mp[i]){
            int j=e.first,w=e.second;
            if(val[pos2[w]]){
                to[buc[i].back()]=j;
                buc[i].pop_back();
            }
            int tmp=val[pos1[w]];
            while(tmp--){
                buc[j].push_back(buc[i].back());
                buc[i].pop_back();
            }
        }
    }
    for(int i=1;i<=num;i++)
        if(!to[i])col[i]=++ans;else col[i]=col[to[i]];
    for(int i=1;i<=n;i++)printf("%d ",col[id[i]]);printf("\n");
    return 0;
}