#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include<stack>
using namespace std;
int fa[100000],col[100000];
int g(int x){
    if(x==fa[x])return x;
    return fa[x]=g(fa[x]);
}
namespace dinic{
#define int long long
const int inf=1e18;
const int N=2*130*130;
const int M=1e5;
vector<pair<int,int>>v[N];
int cnt=-1;

int s,t,c[N];
void link(int x,int y,int _c){
    cnt++;v[x].push_back(make_pair(y,cnt));c[cnt]=_c;
    cnt++;v[y].push_back(make_pair(x,cnt));c[cnt]=0;
}int dis[N];
void bfs(){
    queue<int>q;
    memset(dis,-1,sizeof(dis));
    q.push(s);dis[s]=0;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(auto [y,id]:v[x]){
            if((!c[id])||dis[y]!=-1) continue;
            dis[y]=dis[x]+1;q.push(y);
        }
    }
}
int cur[N];
int dfs(int x,int lim){
    if(x==t)return lim;
    if(!lim)return 0;
    int ans=0;
    for(int &i=cur[x];i<v[x].size();i++){
        auto[y,id]=v[x][i];
        if(c[id]==0||dis[y]!=dis[x]+1) continue;
        int res=dfs(y,min(lim,c[id]));
        c[id]-=res,c[id^1]+=res,ans+=res,lim-=res;
        if(!lim) break;
    }return ans;
}
int dinic(){
    int ans=0;
    while(1){
        memset(cur,0,sizeof(cur));bfs();
        int res=dfs(s,inf);
        if(!res) break;
        ans+=res;
    }return ans;
}
int dfs(int x){
    for(auto[y,id]:v[x]){
        if(c[id^1]==0||id%2==1) continue;
        c[id^1]--;c[id]++;
        if(y==t) return x;
        return dfs(y);
    }
}
void solve(int now){
    for(auto[y,id]:v[s]){
        if(c[id]==0){
            int u=y,v=dfs(y)-now;
            // cerr<<"? "<<u<<" "<<v<<endl;
            fa[g(v)]=g(u);
        }
    }
}
}
bool vis[100100];
int low[100100];
int dfn[100100];
int belong[100100];
int siz[100100];
int now, step, sum;
vector<int> v[100100];
stack<int> s;
void tarjan(int x)
{
	if (vis[x])return;
	low[x] = dfn[x] = ++step;
	vis[x] = true;
	s.push(x);
	for (int i = 0; i < v[x].size(); i++)
	{
		int y = v[x][i];
		if (!dfn[y])
		{
			tarjan(y);
			low[x] = low[x] < low[y] ? low[x] : low[y];
		}
		if (vis[y])
		{
			low[x] = low[x] < dfn[y] ? low[x] : dfn[y];
		}
	}
	if (low[x] == dfn[x])
	{
		int y = -1;
		now++;
		vis[x] = false;
		while (y != x)
		{
			y = s.top();
			s.pop();
			belong[y] = now;
			siz[now]++;
			vis[y] = false;
		}
	}

}
using dinic::link;

int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y;cin>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!dfn[i]) tarjan(i);
    dinic::s=now*2+1;
    dinic::t=now*2+2;
    for(int i=1;i<=n;i++){
        for(int j:v[i]){
            if(belong[i]==belong[j]){
                continue;
            }
            int u=belong[i],v=belong[j];
            link(u,v+now,1000000000);
        }
    }
    for(int i=1;i<=now;i++) link(dinic::s,i,1);
    for(int i=1;i<=now;i++) link(now+i,dinic::t,1);
    for(int i=1;i<=now;i++) link(now+i,i,1000000000);
    cerr<<"?? "<<now-dinic::dinic()<<" "<<now<<endl;
    for(int i=1;i<=now;i++) fa[i]=i;
    dinic::solve(now);
    int id=0;
    for(int i=1;i<=now;i++){
        if(g(i)==i) col[i]=(++id);
    }
    for(int i=1;i<=n;i++) cout<<col[g(belong[i])]<<" ";
    // for(auto[y,id]:dinic::v[dinic])
}