#include <bits/stdc++.h>
using namespace std;

const int N = 14114;
int n, m;
vector <int> d[N], v[N];

int dfn[N], low[N], scc[N], sz[N];
int id, cnt;

stack <int> s;
void tarjan(int st)
{
    dfn[st] = low[st] = ++ id;
    s.push(st);
    for(auto ed : d[st])
    {
        if(!dfn[ed])
        {
            tarjan(ed);
            low[st] = min(low[st], low[ed]);
        }
        else if(!scc[ed])
            low[st] = min(low[st], low[ed]);
    }

    if(low[st] == dfn[st])
    {
        scc[st] = ++ cnt;
        sz[cnt] = 1;
        while(s.size() && s.top() != st)
        {
            scc[s.top()] = cnt;
            sz[cnt] ++;
            s.pop();
        }
        s.pop();
    }
}

const int inf = 1e9 + 1;
int S, T;

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

struct edge
{
	int ed;
	int len;
	int id;
    bool fl;
};

vector <edge> e[N];

void add(int st, int ed, int len)
{
    // cout << st << " " << ed << " " << len << " ???\n";
	int sti = e[st].size();
	int edi = e[ed].size();
	e[st].push_back((edge){ed, len, edi, 0});
	e[ed].push_back((edge){st, 0, sti, 1});
}

int dep[N], cur[N];
bool bfs()
{
	memset(dep, 0, sizeof(dep));
	memset(cur, 0, sizeof(cur));
	queue <int> q;
	q.push(S);
	dep[S] = 1;
	while(!q.empty())
	{
		int st = q.front();
		q.pop();
		for(int i = 0; i < e[st].size(); i = i + 1)
		{
			int ed = e[st][i].ed;
			if(!dep[ed] && e[st][i].len)
				q.push(ed), dep[ed] = dep[st] + 1;
		}
	}
	return dep[T];
}

int dfs(int st, int limit)
{
	if(st == T)
		return limit;
	for(int i = cur[st]; i < e[st].size(); i = i + 1)
	{
		cur[st] = i;
		int ed = e[st][i].ed;
		int len = e[st][i].len;
		if(dep[ed] == dep[st] + 1 && len)
		{
			int t = dfs(ed, min(limit, len));
			if(t)
			{
				e[st][i].len -= t;
				e[ed][e[st][i].id].len += t;
				return t;
			}
			else
				dep[ed] = -1;
		}
	}
	return 0;
}

bool is[N];
int dinic()
{
	int res = 0, flow = 0;
	while(bfs())
		while(flow = dfs(S, inf))
			res += flow;
    for(int i = 0; i < e[S].size(); i = i + 1)
        if(e[e[S][i].ed][e[S][i].id].len)
            // cout << e[S][i].ed << " ?\n",
            is[e[S][i].ed] = 1;
    for(auto ed : e[T])
        if(ed.len)
        {
            int v = ed.ed, u = v;
            // cout << v << " ????\n";
            while(1)
            {
                if(u >= 1 && u <= n && is[u])
                {
                    is[u] = 0;
                    break;
                }
                int w = 0, tmp = 0;
                for(int i = 0; i < e[u].size(); i = i + 1)
                {
                    auto p = e[u][i];
                    if(p.fl == 1 && p.len)
                    {
                        w = p.ed;
                        tmp = i;
                        // cout << w << " " << tmp << " g\n";
                        break;
                    }
                }
                if(!w) break;
                e[u][tmp].len --;
                // cout << w << " &&&\n";
                u = w;
            }
            // cout << u << " " << v << " " << n << " (((\n";
            fa[find(u)] = find(v - n);
        }
    // cout << res << " !!!\n";
	return res;
}

int ans[N];

signed main()
{
    cin >> n >> m;
    for(int i = 1, st, ed; i <= m; i = i + 1)
    {
        cin >> st >> ed;
        d[st].push_back(ed);
    }
    for(int i = 1; i <= n; i = i + 1)
        if(!dfn[i])
            // cout << i << " ^^^^\n",
            tarjan(i);
    for(int i = 1; i <= n; i = i + 1)
        for(auto j : d[i])
            if(scc[i] != scc[j])
                v[scc[i]].push_back(scc[j]);
    int tmp = n;
    n = cnt;
    S = 0, T = n * 2 + 1;
    for(int i = S; i <= T; i = i + 1)
        fa[i] = i;
    for(int i = 1; i <= n; i = i + 1)
    {
        add(S, i, 1);
        add(i + n, T, 1);
        add(i + n, i, inf);
        for(auto j : v[i])
            add(i, j + n, inf);
    }
    dinic();
    int all = 0;
    for(int i = 1; i <= tmp; i = i + 1)
    {
        int x = find(scc[i]);
        if(!ans[x])
            ans[x] = ++ all;
        cout << ans[x] << " ";
    }
    cout << "\n";
    return 0;
}