#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long GCD(long long a,long long b) {
  if(a%b == 0) return b;
  return GCD(b,a%b);
}
int main() {
  long long N,M; cin >> N >> M;
  vector<pair<int,int>> A(M);
  vector<int> X(N + 1,0);
  for(int i = 0; i < M; i++) {
    int a,b; cin >> a >> b;
    A[i] = {a,b};
    X[b]++;
    X[a + 1]--;
  }
  
  vector<int> Q(N + 1,0);
  for(int i = 1; i <= N; i++) {
    Q[i] = Q[i - 1] + X[i];
  }
  for(int i = N; i >= 1; i--) {
    cout << Q[i] << endl;
  }
}