1
#include <bits/stdc++.h>
2
using namespace std;
3

4
const int N = 2e5 + 100;
5
int ans = 0;
6

7
struct People {
8
    int l, r;
9
    friend bool operator<(const People a, const People b) {
10
        if (a.l == b.l)
11
            return a.r < b.r;
12
        return a.l < b.l;
13
    }
14
} a[N];
15

16
struct People_Prio {
17
    int l, r;
18
    friend bool operator<(const People_Prio a, const People_Prio b) {
19
        return a.r > b.r;
20
    }
21
};
22

23
int n, m;
24
priority_queue<People_Prio> pq;
25

26
signed main() {
27
    cin >> n >> m;
28
    for (int i = 1; i <= m; i++) {
29
        cin >> a[i].l >> a[i].r;
30
    }
31
    int ptr = 0;
32
    sort(a + 1, a + m + 1);
33
    for (int i = 1; i <= n; i++) {
34
        // 将所有可用的都放入优先队列：
35
        while (ptr != m && a[ptr + 1].l <= i) {
36
            pq.push({a[++ptr].l, a[ptr].r});
37
        }
38
        while (!pq.empty()) {
39
            auto top = pq.top();
40
            pq.pop();
41
            if (top.r < i) {
42
                continue;
43
            }
44
            ans++;
45
            break;
46
        }
47
        cout << ans << endl;
48
    }
49
    return 0;
50
}