#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
#define int long long
const int N = 1e6 + 5, inf = 0x3f3f3f3f3f3f3f3f;

vector<int>G[N], Gx[N];

int dfn[N], low[N], ins[N], num;
stack<int>s;
int scc[N], siz[N], scc_cnt;

void tarjan(int u){
    dfn[u] = low[u] = ++num;
    s.push(u);
    ins[u] = 1;
    for(auto v : G[u]){
        if(!dfn[v]){
            tarjan(v);
            low[u] = min(low[v], low[u]);
        }else if(ins[v]) low[u] = min(low[u], dfn[v]);
    }
    if(low[u] == dfn[u]){
        int v;
        scc_cnt++;
        do{
            v = s.top();
            s.pop();
            scc[v] = scc_cnt;
            siz[scc_cnt]++;
            ins[v] = 0;
        }while(v != u);
    }
}

int in[N], dp[N];

void topo(){
    queue<int>q;
    q.push(scc[1]);
    if(siz[scc[1]] > 1) dp[scc[1]] = inf;
    else dp[scc[1]] = 1;
    while(!q.empty()){
        int u = q.front();
        q.pop();
        for(auto v : Gx[u]){
            in[v]--;
            dp[v] = min(inf, dp[v] + dp[u]);
            if(siz[v] > 1) dp[v] = inf;
            if(in[v] == 0) q.push(v);
        }
    }
}

void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
    }
    tarjan(1);
    for(int u = 1; u <= n; u++){
        for(auto v : G[u]){
            if(scc[u] == 0 || scc[v] == 0) continue;
            if(scc[u] == scc[v]) continue;
            Gx[scc[u]].push_back(scc[v]);
            in[scc[v]]++;
        }
    }
    topo();
    for(int i = 1; i <= n; i++){
        if(dp[scc[i]]) cout << (dp[scc[i]] == inf ? 3 : dp[scc[i]] > 1 ? 2 : 1) << ' ';
        else cout << 0 << ' ';
    }
}

signed main(){
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}