#include <bits/stdc++.h>


#include <vector>

namespace atcoder {

namespace internal {

template <class T> struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

}  // namespace internal

}  // namespace atcoder

#include <limits>


#include <cassert>
#include <numeric>
#include <type_traits>

namespace atcoder {

namespace internal {

#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
    typename std::conditional<std::is_same<T, __int128_t>::value ||
                                  std::is_same<T, __int128>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using is_unsigned_int128 =
    typename std::conditional<std::is_same<T, __uint128_t>::value ||
                                  std::is_same<T, unsigned __int128>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using make_unsigned_int128 =
    typename std::conditional<std::is_same<T, __int128_t>::value,
                              __uint128_t,
                              unsigned __int128>;

template <class T>
using is_integral = typename std::conditional<std::is_integral<T>::value ||
                                                  is_signed_int128<T>::value ||
                                                  is_unsigned_int128<T>::value,
                                              std::true_type,
                                              std::false_type>::type;

template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
                                                 std::is_signed<T>::value) ||
                                                    is_signed_int128<T>::value,
                                                std::true_type,
                                                std::false_type>::type;

template <class T>
using is_unsigned_int =
    typename std::conditional<(is_integral<T>::value &&
                               std::is_unsigned<T>::value) ||
                                  is_unsigned_int128<T>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using to_unsigned = typename std::conditional<
    is_signed_int128<T>::value,
    make_unsigned_int128<T>,
    typename std::conditional<std::is_signed<T>::value,
                              std::make_unsigned<T>,
                              std::common_type<T>>::type>::type;

#else

template <class T> using is_integral = typename std::is_integral<T>;

template <class T>
using is_signed_int =
    typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using is_unsigned_int =
    typename std::conditional<is_integral<T>::value &&
                                  std::is_unsigned<T>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using to_unsigned = typename std::conditional<is_signed_int<T>::value,
                                              std::make_unsigned<T>,
                                              std::common_type<T>>::type;

#endif

template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;

template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;

template <class T> using to_unsigned_t = typename to_unsigned<T>::type;

}  // namespace internal

}  // namespace atcoder


inline namespace templates {
	namespace internal{
		using namespace atcoder::internal;
	}
}
#include <utility>
#include <vector>

inline namespace templates {
	template <typename T, typename = internal::is_signed_int_t<T>>
	struct MaxFlow {
		static constexpr T Inf = std::numeric_limits<T>::max();
		int n;
		struct Edge {
			int v;
			T w;
		};
		std::vector<Edge> e;
		std::vector<std::vector<int>> g;
		MaxFlow(int _n) : n(_n), g(n) {}
		std::pair<int, int> add_edge(int u, int v, T w) {
			g[u].push_back(e.size());
			e.push_back({v, w});
			g[v].push_back(e.size());
			e.push_back({u, 0});
			return {int(e.size()) - 2, int(e.size()) - 1};
		}
		T flow(int s, int t) {
			T res = 0;
			while (bfs(s, t)) {
				cur.assign(n + 1, 0);
				T flow;
				while ((flow = dinic(s, t, Inf)))
					res += flow;
			}
			return res;
		}
		std::vector<std::tuple<int, int, T>> edges() const {
			std::vector<std::tuple<int, int, T>> edge;
			for (int i = 0; i < int(e.size()); i += 2) {
				edge.emplace_back(e[i ^ 1].v, e[i].v, e[i].w);
			}
			return edge;
		}

	private:
		std::vector<int> cur, dis;
		bool bfs(int s, int t) {
			dis.assign(n, 0);
			internal::simple_queue<int> q;
			q.reserve(n);
			q.push(s);
			dis[s] = 1;
			while (q.size()) {
				int u = q.front();
				q.pop();
				for (int i : g[u]) {
					int v = e[i].v;
					if (e[i].w && !dis[v]) {
						dis[v] = dis[u] + 1;
						q.push(v);
						if (v == t)
							return 1;
					}
				}
			}
			return 0;
		}
		T dinic(int u, int t, T flow) {
			if (u == t)
				return flow;
			T rest = flow;
			for (int i = cur[u]; i < int(g[u].size()) && rest; ++i) {
				cur[u] = i;
				int j = g[u][i], v = e[j].v;
				if (e[j].w && dis[v] == dis[u] + 1) {
					T k = dinic(v, t, std::min(rest, e[j].w));
					if (!k)
						dis[v] = 0;
					e[j].w -= k, e[j ^ 1].w += k, rest -= k;
				}
			}
			return flow - rest;
		}
	};
} // namespace templates
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=7005;
int n,m,tot,bel[N],ans[N];
vector<int> g[N],scc[N],g2[N];
vector<pair<int,int>> G[N*2];
struct{
	int dfn[N],low[N],dfx,stk[N],top,vis[N];
	void tarjan(int u){
		low[u]=dfn[u]=++dfx;
		stk[++top]=u;
		vis[u]=1;
		for(int v:g[u]){
			if(!dfn[v]){
				tarjan(v);
				low[u]=min(low[u],low[v]);
			}else if(vis[v]){
				low[u]=min(low[u],dfn[v]);
			}
		}
		if(dfn[u]==low[u]){
			++tot;
			for(int v=0;v!=u;){
				v=stk[top--];
				bel[v]=tot;
				scc[tot].push_back(v);
				vis[v]=0;
			}
		}
	}
	void operator()(){
		For(u,1,n){
			if(!dfn[u]){
				tarjan(u);
			}
		}
	}
}tarjan;
void color(int u,int c){
	for(int v:scc[u]){
		ans[v]=c;
	}
	for(int v:g2[u]){
		if(!ans[scc[v][0]]){
			color(v,c);
		}
	}
}
vector<pair<int,int>*> pth;
bool vis[N*2],used[N];
int flg;
void dfs(int u){
	if(flg) return;
	vis[u]=1;
	if(u>tot&&!used[u-tot]){
		used[u-tot]=1;
		flg=u-tot;
		for(auto ptr:pth){
			--ptr->second;
		}
		return;
	}
	for(auto& x:G[u]){
		auto [v,w]=x;
		if(w&&!vis[v]){
			vis[v]=1;
			pth.push_back(&x);
			dfs(v);
			pth.pop_back();
		}
	}
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>m;
	For(i,1,m){
		int u,v;
		cin>>u>>v;
		g[u].push_back(v);
	}
	tarjan();
	MaxFlow<int> f(tot*2+3);
	int s=f.n-2,t=f.n-1;
	For(u,1,tot){
		f.add_edge(s,u,1);
		f.add_edge(u+tot,t,1);
		for(int v:scc[u]){
			for(int x:g[v]){
				if(bel[x]!=u){
					f.add_edge(u,bel[x]+tot,1);
					f.add_edge(u+tot,bel[x]+tot,f.Inf);
				}
			}
		}
	}
	int expected=tot-f.flow(s,t);
	cerr<<expected<<'\n';
	vector<int> poi;
	for(int i:f.g[s]){
		auto [u,w]=f.e[i];
		if(!w){
			poi.push_back(u);
			for(int i:f.g[u]){
				int v=f.e[i].v;
				if(v!=s){
					G[u].emplace_back(v,f.e[i^1].w);
				}
			}
		}
	}
	For(u,tot+1,tot*2){
		for(int i:f.g[u]){
			int v=f.e[i].v;
			if(v<u&&v!=t){
				G[u].emplace_back(v,f.e[i^1].w);
			}else if(v==t){
				used[u-tot]=f.e[i].w;
			}
		}
	}
	for(int s:poi){
		flg=0;
		fill(vis,vis+tot*2+1,0);
		dfs(s);
		assert(flg);
		g2[s].push_back(flg);
		g2[flg].push_back(s);
	}
	int cur=0;
	For(u,1,tot){
		if(!ans[scc[u][0]]){
			color(u,++cur);
		}
	}
	cerr<<cur<<'\n';
	assert(cur==expected);
	For(u,1,n){
		cout<<ans[u]<<" \n"[u==n];
	}
	return 0;
}