#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int cur[N],loset[N],cnt[N],win[N],ans[N]; // losing time
struct node{
    int label, ori;
};
vector<node> A[N];
map<int,int> mp;
int n,m,a,b;
// int mxidx=-1,mx=0,oldidx,oldmx;

// the medal that the loss of this created
void dfs(int u,int mx,int mxidx, int par = -1) {
    int cori = mp[u];
    if(mxidx!=-1) {
        // cout << "at " << u << " " << cori << " " << mx << " " << mxidx << "\n";
        ans[mxidx]++;
    }
    for(auto [id,ori] : A[u]) {
        int curmx = mx, curidx = mxidx;
        // add mx in cnt
        cnt[cori] += loset[u] - loset[id];
        // oldidx = mxidx, oldmx = mx;
        // cout << "cnt " << cori << " = " << cnt[cori] << "\n";
        if(cnt[cori] > curmx) {
            curmx = cnt[cori];
            curidx = cori;
        } else if(cnt[cori] == curmx) {
            curidx = min(curidx,cori);
        }
        dfs(id,curmx,curidx,u);
        cnt[cori] -= loset[u] - loset[id];
        // mxidx =  oldidx, mx = oldmx;
        // remove cnt
    }
}
int main() {
    cin>>n>>m;
    int id=n+1;
    for(int i = 0;i<n;i++)cur[i]=i,mp[i] = i;
    for(int i = 0;i<m;i++){
        cin>>a>>b; // a beats b
        A[cur[a]].push_back({cur[b],b});
        // cout << cur[a] << " " << a << " " << cur[b] << " " << b << "\n";
        // b loses so gets to reset
        loset[cur[b]] = i;
        win[cur[a]] = 1;
        win[cur[b]] = 0;
        cur[b] = id++;
        mp[cur[b]] = b;
    }
    // dfs for each of the winners in the end
    // for(int i = 0;i<id;i++) {
    //     cout << i << " " << loset[i] << "\n";
    // }
    for(int i = 0;i<id;i++) {
        if(win[i]) {
            // cout << "\nstart " << i << "\n";
            loset[i] = m;
            dfs(i,0,-1);
        }
    }
    for(int i = 0;i<n;i++)cout<<ans[i]<<" ";
}

/*


3 4
0 1
2 1
1 0
2 1

3 7
0 1
0 2
2 0
0 1
1 0
2 0
0 2



*/