#include<bits/stdc++.h>
using namespace std;
const int MAXN =1e5+10;
vector<int>e[MAXN];
bool vis[MAXN];
int col[MAXN];
int cnt[MAXN];
int low[MAXN],dfn[MAXN];
int cnta[MAXN];
bool Isinf[MAXN];
stack<int>st;
void Tarjan(int u){
    dfn[u]=low[u]=++dfn[0];
    vis[u]=1;st.push(u);
    for(int v:e[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]){
        ++col[0];
        int top;
        do{
            top=st.top();st.pop();
            vis[top]=0;col[top]=col[0];cnt[col[0]]++;//cnt[0];
        }while(top!=u);
    }
}
int in[MAXN];
vector<int>E[MAXN];
void Topoo(){
    queue<int>q;cnta[col[1]]=1;Isinf[col[1]]=cnt[col[1]]>1;
    for(int i=1;i<=col[0];++i)if(!in[i])q.push(i);
    while(!q.empty()){
        int u=q.front();q.pop();
        for(int v:E[u]){
            cnta[v]+=cnta[u];
            if(cnta[u])Isinf[v]=Isinf[u]|(cnt[v]>1);
            in[v]--;if(!in[v])q.push(v);
        }
    }
}
int n,m;
set<pair<int,int>>is;
vector<pair<int,int>>edge;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i){
        int u,v;scanf("%d%d",&u,&v);
        e[u].push_back(v);edge.push_back(make_pair(u,v));
    }
    for(int i=1;i<=n;++i)if(!dfn[i])Tarjan(i);
    memset(vis,0,sizeof(vis));
    for(auto x:edge){
        int u=x.first,v=x.second;
        if(col[u]==col[v])continue;
        else if(is.count(make_pair(col[u],col[v])))continue;
        is.insert(make_pair(col[u],col[v]));
        E[col[u]].push_back(col[v]);
        in[col[v]]++;
    }
    Topoo();
    //for(int i=1;i<=col[0];++i)cout<<cnt[i]<<" ";
    //cout<<endl;
    for(int i=1;i<=n;++i){
        if(cnta[col[i]]==0)printf("0 ");
        else if(Isinf[col[i]])printf("3 ");
        else if(cnta[col[i]]==1)printf("1 ");
        else printf("2 ");
    }
    return 0;
}