#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;



typedef struct { int i, x; } RNode;
RNode rs[1000004];
bool mycmp(const RNode& a, const RNode& b) {
    if (a.i!=b.i) return a.i<b.i;
    return a.x<b.x;
}
int main() {
    int n, i, m, k, l, r, j, c;
    scanf("%d %d", &n, &m);
    k=0;
    for (i=0; i<m; i++) {
        scanf("%d %d", &l, &r);
        l=n-l+1; r=n-r+1;
        rs[k].i=l; rs[k].x=1; k++;
        rs[k].i=r+1; rs[k].x=-1; k++;
    }
    sort(rs, rs+k, mycmp);
    c=0;
    for (i=0, j=1; j<=n; j++) {
        while(i<k&&rs[i].i==j) {
            c+=rs[i].x;
            i++;
        }
        printf("%d\n", c);
    }
    return 0;
}