/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 5e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;

vector<int> e[N];
bitset<N> vis,cir,dou,instk;
void add(int b,int a){
    e[a].pb(b);
}


void dfs(int x){
    vis[x]=1;
    instk[x]=1;
    for(auto v:e[x]){
        if(instk[v]){
            cir[v]=1;
        }else if(vis[v]){
            dou[v]=1;
        }else{
            dfs(v);
        }
    }


    instk[x]=0;
}

void dfs2(int x){
    cir[x]=1;
    for(auto v:e[x]){
        if(cir[v])continue;
        dfs2(v);
    }
}

void dfs3(int x){
    dou[x]=1;
    for(auto v:e[x]){
        if(dou[v])continue;
        dfs3(v);
    }
}

void solve() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);


    int n=rd,m=rd;

    // for(int i=1;i<=n;i++){
    //     while(e[i].size())e[i].pop_back();
    // }
    for(int i=1;i<=m;i++){
        add(rd,rd);
    }

    

    dfs(1);

    for(int i=1;i<=n;i++){
        if(cir[i])dfs2(i);
    }
    for(int i=1;i<=n;i++){
        if(dou[i])dfs3(i);
    }

    for(int i=1;i<=n;i++){
        if(!vis[i])cout<<0<<' ';
        else if(cir[i])cout<<3<<' ';
        else if(dou[i])cout<<2<<' ';
        else cout<<1<<' ';
    }
    cout<<endl;
}

signed main(){
    int t=1;
    while(t--){
        // vis.reset();
        // cir.reset();
        // dou.reset();
        solve();
    }
}