#include <bits/stdc++.h>
using namespace std;
vector<int> n[3 * (int)1e5 + 2];
int main() {
  int N, M;
  cin >> N >> M;
  for (int(i) = (0); (i) < (int)(N); ++(i)) {
    int l, r;
    cin >> l >> r;
    for (int j = l; j <= r; ++j) n[j].push_back(i);
  }
  for (int d = 1; d <= M; ++d) {
    set<int> s;
    for (int pos = 0; pos <= M; pos += d) {
      for (auto t : n[pos]) {
        s.insert(t);
      }
    }
    cout << s.size() << endl;
  }
}
