#include <bits/stdc++.h>
#pragma GCC optimize("O3", "Ofast")
#define int long long
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 5e5+10;
const int MAXA = 5e4+10;
const int SQRT = 300;
const ll INF = 2e18;
const int MOD = 1e9+7;
const int LOG = 32;
ll sum(auto a, auto b){
ll te = a+MOD+b;
for(; te >= MOD; ) te -= MOD;
return te;
}
void chsum(auto &a, auto b){ a = sum(a,b); }
ll mul(auto a, auto b){ return 1ll*a*b%MOD; }
void chmul(auto &a, auto b){ a = mul(a,b); }
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
ll expo(int a, int b){
if(b==0) return 1;
ll te = expo(a, b/2); te = mul(te,te); // temporary -> te
return (b%2 ? mul(te, a) : te);
}
vector <int> dx = {0, 0, -1, 1};
vector<int> dy = {-1, 1, 0, 0};
int n, m, x[MAXN], y[MAXN], ANS[MAXN];
int a[MAXN], cnt[MAXN];
struct node {
int mx, idx;
} NOL;
node make(int v, int id){
node ret;
ret.mx = v; ret.idx = id;
return ret;
}
struct seg {
node st[4*MAXN];
node mrg(node a, node b){
node ret;
ret.mx = max(a.mx, b.mx);
if(a.mx == b.mx) ret.idx = min(a.idx, b.idx);
else if(a.mx < b.mx) ret.idx = b.idx;
else ret.idx = a.idx;
return ret;
}
node upd(int id,int l,int r,int x,int y){
if(l==r && l==x) return st[id] = make(y, x);
if(r<x || x<l) return st[id];
return st[id] = mrg(upd(lf,l,md,x,y), upd(rg,md+1,r,x,y));
}
node que(int id,int l,int r,int x,int y){
if(x<=l && r<=y) return st[id];
if(r<x || y<l) return NOL;
return mrg(que(lf,l,md,x,y), que(rg,md+1,r,x,y));
}
} A;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
NOL.mx = 0; NOL.idx = INF;
for(int i=1; i<=m; i++){
cin>>x[i]>>y[i];
x[i]++; y[i]++;
}
for(int i=1; i<=m; i++){ // ini days nya
// cout << i << ' '<< x[i] << " i\n";
a[i] = x[i];
cnt[a[i]]++;
A.upd(1,1,m,a[i],cnt[a[i]]);
}
for(int i=1; i<=m; i++){ // medal ini siapa yg menang
// cout << i << ' '<< A.que(1,1,m,1,m).mx <<' '<<A.que(1,1,m,1,m).idx << " winner\n";
if(i!=1){
cnt[a[i-1]]--;
A.upd(1,1,m, a[i-1], cnt[a[i-1]]);
}
int w = A.que(1,1,m,1,m).idx;
// cout << i << ' '<< A.que(1,1,m,1,m).mx <<' '<<A.que(1,1,m,1,m).idx << " w\n";
ANS[w]++;
}
for(int i=1; i<=n; i++) cout << ANS[i] << " \n"[i==n];
}
