#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 100;
bool vis[N];
vector<int> e[N], g[N];
int n, m;
int mtd[N], rcb[N], inf[N], siz[N], deg[N], scnt;
int dfn[N], low[N], col[N], clk;
int st[N], tp;bool inst[N];
void tarjan(int u){
	dfn[u] = low[u] = ++clk;
	st[++tp] = u;inst[u] = 1;
	for(int v : e[u]){
		if(!dfn[v]){
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if(inst[v]) low[u] = min(low[u], dfn[v]);
	}
	if(low[u] == dfn[u]){
		++scnt;
		for(int x = 0;x != u;--tp){
			x = st[tp];
			inst[x] = 0;
			col[x] = scnt;
            siz[scnt]++;
		}
	}
}
int32_t main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1;i <= m;i++){
        int u, v;cin >> u >> v;
        e[u].push_back(v);
    }
    for(int i = 1;i <= n;i++) if(!dfn[i]) tarjan(i);
    for(int i = 1;i <= n;i++){
        for(int j : e[i]){
            int u = col[i], v = col[j];
            if(u == v) continue;
            deg[v]++;
            g[u].push_back(v);
        }
    }
    queue<int> q;
    for(int i = 1;i <= scnt;i++) if(!deg[i]) q.push(i);
    rcb[col[1]] = 1;mtd[col[1]] = 1;
    while(!q.empty()){
        int u = q.front();
        q.pop();
        if(siz[u] > 1 && rcb[u]) inf[u] = 1;
        for(int v : g[u]){
            if(rcb[u]) rcb[v] = 1;
            if(inf[u]) inf[v] = 1;
            mtd[v] += mtd[u];
            if(mtd[v] > 2) mtd[v] = 2;
            deg[v]--;
            if(!deg[v]) q.push(v);
        }
    }
    for(int i = 1;i <= n;i++){
        int u = col[i];
        if(!rcb[u]) cout << 0;
        else if(inf[u]) cout << 3;
        else if(mtd[u] == 1) cout << 1;
        else cout << 2;
        cout << " ";
    }
    return 0;
}