#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 7070

int n,m;
vector<int>V[sz],vv[sz];

int dfn[sz],low[sz],cc,bel[sz],T;
int in[sz]; stack<int>st;
void tarjan(int x) {
    dfn[x]=low[x]=++cc; st.push(x); in[x]=1;
    for (auto v:V[x]) {
        if (!dfn[v]) tarjan(v),chkmin(low[x],low[v]);
        else if (in[v]) chkmin(low[x],dfn[v]);
    }
    if (dfn[x]==low[x]) {
        int y; ++T;
        do y=st.top(),st.pop(),in[y]=0,bel[y]=T; while (y!=x);
    }
}

bitset<sz>b[sz];
using Set = bitset<sz>;
bool dfs(int x,Set &unvis,vector<int>&match) {
    for (Set z=b[x];;) {
        z&=unvis;
        int y=z._Find_first();
        if (y==sz) return 0;
        if (unvis.reset(y),!match[y]||dfs(match[y],unvis,match)) return match[y]=x,1;
    }
}
vector<int>match(int nn) {
    Set unvis; unvis.set();
    vector<int>match(nn+1),ret(nn+1);
    rep(i,1,nn)
        if (dfs(i,unvis,match))
            unvis.set();
    rep(i,1,nn) ret[match[i]]=i;
    return ret[0]=0,ret;
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n>>m;
    int x,y;
    rep(i,1,m) cin>>x>>y,V[x].push_back(y);
    rep(i,1,n) if (!dfn[i]) tarjan(i);
    rep(x,1,n) for (auto v:V[x]) vv[bel[x]].push_back(bel[v]),assert(bel[v]<=bel[x]);
    rep(i,1,T) b[i][i]=1;
    rep(i,1,T) for (auto j:vv[i]) b[i]|=b[j];
    rep(i,1,T) b[i][i]=0;
    auto ret=match(T);
    static int col[sz]; int cc=0;
    drep(i,T,1) if (!col[i]) {
        ++cc;
        for (int x=i;x;x=ret[x]) col[x]=cc;
    }
    rep(i,1,n) cout<<col[bel[i]]<<" \n"[i==n];
    return 0;
}