#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<29;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-9;
const ll mod=1e9+7;
//const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};



int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin>>n>>m;
	vp a(n),b(m);
	for(int i=0;i<n;i++) a[i]={i,i};
	for(int i=0;i<m;i++) cin>>b[i].first>>b[i].second;
	sort(b.begin(),b.end());
	for(int i=0;i<m;i++){
		int j=b[i].second-1;
		a[j].second=a[j+1].second;
		a[j+1].first=a[j].first;
	}
	for(int i=0;i<n;i++){
		if(i) cout<<' ';
		cout<<a[i].second-a[i].first+1;
	}
	cout<<endl;
}

### Prompt

Create a solution in CPP for the following problem:

Example

Input

4 3
1000 1
2000 2
3000 3


Output

2 3 4 4

### Response

```cpp
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<29;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-9;
const ll mod=1e9+7;
//const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};



int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin>>n>>m;
	vp a(n),b(m);
	for(int i=0;i<n;i++) a[i]={i,i};
	for(int i=0;i<m;i++) cin>>b[i].first>>b[i].second;
	sort(b.begin(),b.end());
	for(int i=0;i<m;i++){
		int j=b[i].second-1;
		a[j].second=a[j+1].second;
		a[j+1].first=a[j].first;
	}
	for(int i=0;i<n;i++){
		if(i) cout<<' ';
		cout<<a[i].second-a[i].first+1;
	}
	cout<<endl;
}

```