#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-12;

//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N >> M;
	vector<pair<int, int>>v(M);
	for (auto &i : v)cin >> i.first >> i.second;
	sort(v.begin(), v.end());
	vector<int>l(N + 1);
	vector<int>r(N + 1);
	for (int i = 1; i <= N; i++) {
		l[i] = r[i] = i;
	}
	for (auto i : v) {
		l[i.second] = l[i.second + 1] = min(l[i.second], l[i.second + 1]);
		r[i.second] = r[i.second + 1] = max(r[i.second], r[i.second + 1]);
	}
	for (int i = 1; i <= N; i++) {
		if (i > 1)cout << " ";
		cout << r[i] - l[i] + 1;
	}
	cout << endl;
}

### Prompt

Generate a CPP solution to the following problem:

Example

Input

4 3
1000 1
2000 2
3000 3


Output

2 3 4 4

### Response

```cpp
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-12;

//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N >> M;
	vector<pair<int, int>>v(M);
	for (auto &i : v)cin >> i.first >> i.second;
	sort(v.begin(), v.end());
	vector<int>l(N + 1);
	vector<int>r(N + 1);
	for (int i = 1; i <= N; i++) {
		l[i] = r[i] = i;
	}
	for (auto i : v) {
		l[i.second] = l[i.second + 1] = min(l[i.second], l[i.second + 1]);
		r[i.second] = r[i.second + 1] = max(r[i.second], r[i.second + 1]);
	}
	for (int i = 1; i <= N; i++) {
		if (i > 1)cout << " ";
		cout << r[i] - l[i] + 1;
	}
	cout << endl;
}

```