#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M, L, R;
    cin >> N >> M;
    vector<int> S(N+5);
    for (int i=0; i<M; i++){
        cin >> R >> L;
        S[R+1]++;
        S[L]--;
    }

    for (int i=N+3; i>=0; i--){
        S[i] += S[i+1];
    }

    for (int i=N+1; i>=2; i--) cout << S[i] << endl;

    return 0;
}