#include <bits/stdc++.h>
using namespace std;
int N, M, l, r, res[100002];
int main() {
  cin >> N >> M;
  for (int i = 0; i != N; ++i) {
    cin >> l >> r;
    int p;
    p = 0;
    for (int j = 1000; j; --j) {
      ++res[max((l - 1) / j, p) + 1];
      p = max(r / j, p);
      --res[p + 1];
    }
  }
  for (int i = 1; i <= M; ++i) {
    res[i] += res[i - 1];
    cout << res[i] << endl;
  }
  return 0;
}
