#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
const int MAXN=3e5+10;
typedef pair<int,int> pii;
int n,m,f[MAXN],ans[MAXN];
vector<pii> v;
int32_t main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m; v.resize(m);
for(auto &[u,j]:v) cin>>u>>j;
rfall(i,m-1,0){
fall(j,0,n-1) f[j]=0;
auto cur=v[i].F;
f[cur]++;
fall(j,i+1,m-1){
if(v[j].S==cur) cur=v[j].F;
f[cur]++;
}
int mx=0;
fall(j,0,n-1) mx=max(mx,f[j]);
fall(j,0,n-1){
if(f[j]==mx){
ans[j]++;
break;
}
}
}
fall(i,0,n-1) cout<<ans[i]<<" ";
cout<<"\n";
}
