#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll
int R[300000];
int L[300000];
void solve() {
	int n, m;
	cin >> n >> m;
	vector<pair<int, int>> inputs;
	REP(i, m) {
		int a, b;
		cin >> a >> b;
		b--;
		inputs.push_back(make_pair(a, b));
	}
	sort(ALL(inputs));
	REP(i, n) {
		R[i] = i;
		L[i] = i;
	}
	//reverse(ALL(inputs));
	REP(i, m) {
		R[inputs[i].second] = R[inputs[i].second + 1];
		L[inputs[i].second + 1] = L[inputs[i].second];
	}
	REP(i, n) {
		if (i != 0) cout << " ";
		cout << R[i] - L[i] + 1;
	}
	cout << endl;
}

#undef int
int main() {
	init();
	solve();
}

### Prompt

Your task is to create a cpp solution to the following problem:

Example

Input

4 3
1000 1
2000 2
3000 3


Output

2 3 4 4

### Response

```cpp
#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll
int R[300000];
int L[300000];
void solve() {
	int n, m;
	cin >> n >> m;
	vector<pair<int, int>> inputs;
	REP(i, m) {
		int a, b;
		cin >> a >> b;
		b--;
		inputs.push_back(make_pair(a, b));
	}
	sort(ALL(inputs));
	REP(i, n) {
		R[i] = i;
		L[i] = i;
	}
	//reverse(ALL(inputs));
	REP(i, m) {
		R[inputs[i].second] = R[inputs[i].second + 1];
		L[inputs[i].second + 1] = L[inputs[i].second];
	}
	REP(i, n) {
		if (i != 0) cout << " ";
		cout << R[i] - L[i] + 1;
	}
	cout << endl;
}

#undef int
int main() {
	init();
	solve();
}

```