#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e - 6
#define FOR(i, a, b) for(int i = a;i <= b;i ++)
#define REP(i, a, b) for(int i = a;i >= b;i --)
#define pa pair<int, int>
#define fr first
#define sd second
#define pb push_back
#define db double
#define MEM(a) memset(a, 0, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
int n, m;
#define N 200010
#define M 200010
struct edge
{
	int nxt, to, fl;
} e[M << 1];
int h[N], cur[N], cnt = 1;
int dep[N];
int S, T;
int fa[N], to[N];
inline void add(int x, int y, int fl)
{
	e[++cnt] = (edge) {h[x], y, fl}; h[x] = cnt;
	e[++cnt] = (edge) {h[y], x, +0}; h[y] = cnt;
}
int bfs()
{
	queue<int>Q; FOR(i, 1, T)dep[i] = 0, cur[i] = h[i];
	dep[S] = 1; Q.push(S);
	while (!Q.empty())
	{
		int x = Q.front(); Q.pop();
		for (int i = h[x]; i; i = e[i].nxt)if (e[i].fl && !dep[e[i].to])
			{
				int y = e[i].to; Q.push(y); dep[y] = dep[x] + 1;
				if (y == T)return 1;
			}
	}
	return 0;
}
int dfs(int x, int flow)
{
	if (x == T)return flow;
	int res = 0;
	for (int &i = cur[x]; i; i = e[i].nxt)if (e[i].fl && dep[e[i].to] == dep[x] + 1)
		{
			int y = e[i].to, fl = dfs(y, min(flow - res, e[i].fl));
			e[i].fl -= fl;
			e[i ^ 1].fl += fl;
			res += fl;
			if (res == flow)return res;
		}
	if (!res) dep[x] = 0;
	return res;
}
void Dinic()
{
	while (bfs()) {dfs(S, inf);}
}
int find(int x) {return (x == fa[x] ? x : fa[x] = find(fa[x]));}
int dfn[N], low[N], st[N], inst[N], top;
int Ti, num, bel[N];
vector<int>g[N];
void dfs(int x)
{
	dfn[x] = low[x] = ++Ti;
	st[++top] = x; inst[x] = 1;
	for (int y : g[x])
	{
		if (dfn[y]) {if (inst[y])low[x] = min(low[x], low[y]);}
		else {dfs(y); low[x] = min(low[x], low[y]);}
	}
	if (dfn[x] == low[x])
	{
		++num;
		while (st[top] != x)
		{
			bel[st[top]] = num;
			inst[st[top--]] = 0;
		}
		bel[st[top]] = num;
		inst[st[top--]] = 0;
	}
}
int Dfs(int x, int id)
{
	e[id].fl --;
	e[id ^ 1].fl ++;
	for (int i = h[x]; i; i = e[i].nxt)if (e[i].fl && e[i].fl <= num)
		{
			int y = e[i].to;
			if (y != S && y > num) continue;
			if (y == S) {e[i].fl--; e[i ^ 1].fl++; return x;}
			else return Dfs(y, i);
		}
}
int main()
{
	n = read(), m = read();
	FOR(i, 1, m)
	{
		int x = read(), y = read();
		g[x].pb(y);
	}
	FOR(i, 1, n)if (!dfn[i])dfs(i);
	// cerr << num << endl;
	FOR(x, 1, n)for (int y : g[x])if (bel[x] != bel[y])
		{
			add(bel[x], bel[y] + num, 1);
			add(bel[x], bel[y], inf);
		}
	S = 2 * num + 1, T = S + 1;

	FOR(i, 1, num)
	{
		add(S, i, 1);
		add(i + num, T, 1);
	}
	Dinic();

	FOR(x, 1, num)
	{
		for (int i = h[x + num]; i; i = e[i].nxt)
		{
			int y = e[i].to;
			if (y <= num && e[i].fl)
			{
				to[x] = Dfs(y, i);
			}
		}
	}
	FOR(i, 1, num)fa[i] = i;
	FOR(i, 1, num)if (to[i])fa[find(i)] = find(to[i]);
	vector<int>c(n + 1, 0);
	int tot = 0;
	FOR(i, 1, n)
	{
		int x = find(bel[i]);
		if (!c[x])c[x] = ++tot;
		cout << c[x] << ' ';
	}
	cout << '\n';
	return 0;
}