#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii; //1e9
typedef pair<ll,ll> pll;
const int maxn=4e5+5;
const int INF=0x3f3f3f3f;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define forn(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int n,q,l,r;
int a[maxn];
int f[maxn]; //差分数组
int main()
{
cin>>n>>q;
while(q--){
cin>>l>>r;
f[l]+=1;
f[r+1]-=1; //相当于对之后无影响
}
//原数组第i项 =差分数组前i项和
a[1]=f[1];
for(int i=2;i<=n;i++){
a[i]=a[i-1]+f[i];
}
rep(i,1,n){
cout<<a[i];
if(i!=n)
cout<<" ";
else
cout<<endl;
}
return 0;
}