#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using ll = long long;
using namespace std;


int main()
{
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    
    ll n, m;
    cin >> n >> m;
    vector<ll> d(n), sum(n);
    for (int i = 0; i < m; i++){
        int be, end;
        cin >> be >> end;
        d[n-be]++;
        if (end != 1) d[n- end + 1]--;
    }
    for (int i = 0; i < n; i++){
        sum[i] += d[i];
        if (i) sum[i] += sum[i-1];
        cout << sum[i] << endl;
    }
}