#include<bits/stdc++.h>
using namespace std;

const int maxn=7e3+15;
int n,m,sum,tim,top,s;
int p[maxn],head[maxn],sd[maxn],dfn[maxn],low[maxn];
int stac[maxn],vis[maxn];
int h[maxn],in[maxn],dist[maxn];
struct EDGE
{
    int to;int next;int from;
}edge[maxn*10],ed[maxn*10];
void add(int x,int y)
{
    edge[++sum].next=head[x];
    edge[sum].from=x;
    edge[sum].to=y;
    head[x]=sum;
}
void tarjan(int x)
{
    low[x]=dfn[x]=++tim;
    stac[++top]=x;vis[x]=1;
    for (int i=head[x];i;i=edge[i].next)
    {
        int v=edge[i].to;
        if (!dfn[v]) {
            tarjan(v);
            low[x]=min(low[x],low[v]);
        }
        else if (vis[v])
        {
            low[x]=min(low[x],low[v]);
        }
    }
    if (dfn[x]==low[x])
    {
        int y;
        while (y=stac[top--])
        {
            sd[y]=x;
            vis[y]=0;
            if (x==y) break;
            p[x]+=p[y];
        }
    }
}
int nowCol;
vector<int> cols[maxn];
int ans[maxn];


void topo(){
    queue <int> q;
    for (int i=1;i<=n;i++)
        if (sd[i]==i&&!in[i]){
            q.push(i);
        }
    while (!q.empty())
    {
        int k=q.front();q.pop();
        if(cols[k].empty()) {
            ans[k] = ++nowCol;
            cols[k].push_back(nowCol);
        }else{
            ans[k]=cols[k][0];
        }
        int sz=0;
        for (int i=h[k];i;i=ed[i].next){
            int v=ed[i].to;
            if(sz<cols[k].size())cols[v].push_back(cols[k][sz++]);
            in[v]--;
            if (in[v]==0) q.push(v);
        }
        cols[k].clear();
    }
}



int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        add(u,v);
    }
    for (int i=1;i<=n;i++)
        if (!dfn[i]) tarjan(i);
    for (int i=1;i<=m;i++)
    {
        int x=sd[edge[i].from],y=sd[edge[i].to];
        if (x!=y)
        {
            ed[++s].next=h[x];
            ed[s].to=y;
            ed[s].from=x;
            h[x]=s;
            in[y]++;
        }
    }
    topo();
    for(int i=1;i<=n;i++){
        printf("%d ",ans[sd[i]]);
    }
    return 0;
}