#include <cstdio>
#include <stack>
#include <vector>
#include <queue>
using namespace std;
int n, m, u[100010], v[100010];
int dfn[100010], low[100010], times;
bool in_stack[100010];
stack<int> st;
vector<int> G[100010], sccG[100010], fG[100010];
vector<int> scc[100010];
int scc_cnt, scc_id[100010];
int type[100010], ans[100010];
void tarjan(int u) {
    dfn[u] = low[u] = ++times;
    st.push(u);
    in_stack[u] = true;
    for (int v : G[u]) {
        if (!dfn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        } else if (in_stack[v]) {
            low[u] = min(low[u], dfn[v]);
        }
    }
    if (dfn[u] == low[u]) {
        ++scc_cnt;
        while (true) {
            int t = st.top();
            st.pop();
            in_stack[t] = false;
            scc_id[t] = scc_cnt;
            scc[scc_cnt].push_back(t);
            if (t == u) break;
        }
    }
}
queue<int> q;
int ind[100010];
int ids[100010], tot;
void topo() {
    for (int i = 1; i <= scc_cnt; i++) {
        if (ind[i] == 0) {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int t = q.front();
        q.pop();
        ids[++tot] = t;
        for (int v : sccG[t]) {
            ind[v]--;
            if (ind[v] == 0) {
                q.push(v);
            }
        }
    }
}
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d", &u[i], &v[i]);
        G[u[i]].push_back(v[i]);
    }
    for (int i = 1; i <= n; i++) {
        if (!dfn[i]) {
            tarjan(i);
        }
    }
    for (int i = 1; i <= m; i++) {
        if (scc_id[u[i]] != scc_id[v[i]]) {
            sccG[scc_id[u[i]]].push_back(scc_id[v[i]]);
            fG[scc_id[v[i]]].push_back(scc_id[u[i]]);
            ind[scc_id[v[i]]]++;
        }
    }
    topo();
    for (int i = 1; i <= tot; i++) {
        int cnt = 0;
        for (int u : fG[ids[i]]) {
            if (type[u] == 3) {
                type[ids[i]] = 3;
            } else {
                cnt += type[u];
            }
        }
        if (ids[i] == scc_id[1]) {
            cnt = 1;
        }
        if (cnt && scc[ids[i]].size() > 1) {
            type[ids[i]] = 3;
        }
        if (type[ids[i]] != 3) {
            type[ids[i]] = min(cnt, 2);
        }
        for (int u : scc[ids[i]]) {
            ans[u] = type[ids[i]];
        }
    }
    for (int i = 1; i <= n; i++) {
        printf("%d ", ans[i]);
    }
    printf("\n");
    return 0;
}