// pB
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pii pair<LL, LL>
#define S second
#define F first
const int maxn = 2e5+10;
int n, m;
vector<int> v;
set<pii> st;
int cnt[maxn];
int ans[maxn];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
for(int mm=0; mm<m; mm++){
int x, y; cin>>x>>y;
v.push_back(x);
}
for(int i=v.size()-1; i>=0; i--){
if(cnt[ v[i] ]!=0) st.erase( make_pair(cnt[v[i]], -v[i]) );
cnt[ v[i] ]++;
st.insert( make_pair(cnt[v[i]], -v[i]) );
auto it= prev(st.end());
// cout<<v[i]<<" "<<cnt[v[i]]<<" / "<<it->F<<" "<<it->S<<"\n";
ans[ -(it->S) ]++;
}
for(int i=0; i<n; i++) cout<<ans[i]<<" ";
return 0;
}
