#include <bits/stdc++.h>
#define lzm0107
using namespace std;
using LL = long long;
using AI2 = array<int, 2>;
using PII = pair<int, int>;
using ULL = unsigned long long;
const int N = 7e3, V = 1.4e4, E = 1e6;

int n, m, s, t;
int a[N + 10], b[N + 10];
vector<int> ev[N + 10], stk;
int dfn[N + 10], low[N + 10], bel[N + 10], idx, tot;
bool ins[N + 10];
int to[E + 10], cap[E + 10], nxt[E + 10], head[V + 10], etot;
int dis[V + 10], gap[V + 10], cur[V + 10];
int fa[N + 10], siz[N + 10], col[N + 10], ctot;
int ind[V + 10];
vector<int> poss[V + 10];

void tarjan(int x){
	dfn[x] = low[x] = ++ idx;
	stk.push_back(x);
	ins[x] = 1;
	for(auto i : ev[x]){
		if(!dfn[i]){
			tarjan(i);
			low[x] = min(low[x], low[i]);
		}
		else if(ins[i]){
			low[x] = min(low[x], dfn[i]);
		}
	}
	if(dfn[x] == low[x]){
		tot ++ ;
		for(int i = stk.back(); ; i = stk.back()){
			bel[i] = tot;
			ins[i] = 0;
			stk.pop_back();
			if(i == x){
				break;
			}
		}
	}
}

inline void add(int u, int v, int w){
	to[etot] = v, cap[etot] = w, nxt[etot] = head[u], head[u] = etot ++ ;
	to[etot] = u, nxt[etot] = head[v], head[v] = etot ++ ;
}

int fd(int x){
	return x == fa[x] ? x : fa[x] = fd(fa[x]);
}

void un(int u, int v){
	u = fd(u), v = fd(v);
	if(u != v){
		if(siz[u] < siz[v]) swap(u, v);
		siz[u] += siz[v], fa[v] = u;
	}
}

int SAP(int x, int inf){
	if(x == t) return inf;
	int ouf = 0;
#define i (cur[x])
	for(; ~i; i = nxt[i]){
		if(cap[i] && dis[x] == dis[to[i]] + 1){
			int tmp = SAP(to[i], min(inf - ouf, cap[i]));
			ouf += tmp, cap[i] -= tmp, cap[i ^ 1] += tmp;
			if(inf == ouf || dis[s] == t) return ouf;
		}
	}
	if(!( -- gap[dis[x] ++ ])) dis[s] = t;
	gap[dis[x]] ++ ;
	i = head[x];
#undef i
	return ouf;
}

int main(){
	ios::sync_with_stdio(false);
	*cin.tie(nullptr) << fixed << setprecision(20);

	cin >> n >> m;
	for(int i = 1; i <= m; i ++ ){
		cin >> a[i] >> b[i];
		ev[a[i]].push_back(b[i]);
	}
	for(int i = 1; i <= n; i ++ ){
		if(!dfn[i]){
			tarjan(i);
		}
	}
	s = tot << 1 | 1, t = s + 1;
	memset(head + 1, -1, t << 2);
	for(int i = 1; i <= tot; i ++ ){
		ev[i].clear();
		add(s, i + tot, 1);
		add(i, t, 1);
		add(i, i + tot, 0x3f3f3f3f);
	}
	for(int i = 1; i <= m; i ++ ){
		ev[bel[a[i]]].push_back(bel[b[i]]);
	}
	for(int i = 1; i <= tot; i ++ ){
		sort(ev[i].begin(), ev[i].end());
		ev[i].erase(unique(ev[i].begin(), ev[i].end()), ev[i].end());
		for(auto j : ev[i]){
			if(i != j){
				add(i + tot, j, 0x3f3f3f3f);
			}
		}
	}
	memset(dis + 1, 0x3f, t << 2);
	dis[t] = 0;
	queue<int> q(deque<int>{t});
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int i = head[u]; ~i; i = nxt[i]){
			if(cap[i ^ 1] && dis[to[i]] == 0x3f3f3f3f){
				dis[to[i]] = dis[u] + 1;
				q.push(to[i]);
			}
		}
	}
	for(int i = 1; i <= t; i ++ ){
		if(dis[i] < t){
			gap[dis[i]] ++ ;
		}
	}
	memcpy(cur + 1, head + 1, t << 2);
	while(dis[s] < t){
		SAP(s, 0x3f3f3f3f);
	}
	iota(fa + 1, fa + tot + 1, 1);
	fill(siz + 1, siz + tot + 1, 1);
	for(int i = 1; i < s; i ++ ){
		for(int j = head[i]; ~j; j = nxt[j]){
			if(cap[j] > 0x3f3f0000){
				ind[to[j]] ++ ;
			}
		}
	}
	for(int i = 1; i < s; i ++ ){
		if(!ind[i]){
			q.push(i);
		}
	}
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int i = head[u]; ~i; i = nxt[i]){
			if(to[i] == s && cap[i]){
				poss[u].push_back(u - tot);
			}
			else if(to[i] == t && !cap[i]){
				un(u, poss[u].back());
				poss[u].pop_back();
			}
		}
		for(int i = head[u]; ~i; i = nxt[i]){
			if(cap[i] > 0x3f3f0000){
				assert(cap[i] + cap[i ^ 1] == 0x3f3f3f3f);
				assert(poss[u].size() >= cap[i ^ 1]);
				for(int j = 1; j <= cap[i ^ 1]; j ++ ){
					poss[to[i]].push_back(poss[u].back());
					poss[u].pop_back();
				}
				if(!( -- ind[to[i]])){
					q.push(to[i]);
				}
			}
		}
		assert(poss[u].empty());
		poss[u].clear();
	}
	for(int i = 1; i <= tot; i ++ ){
		if(fa[i] == i){
			col[i] = ++ ctot;
		}
	}
	for(int i = 1; i <= n; i ++ ){
		cout << col[fd(bel[i])] << ' ';
	}
	cout << '\n';
	return 0;
}