#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int> > a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
  }
  vector<int> p(m + 2);
  int q;
  for (int i = 0; i < n; i++) {
    for (int j = 1; j * j <= m; j++) {
      if (a[i].second / j - (a[i].first - 1) / j >= 1) {
        p[j + 1] -= 1;
        p[j] += 1;
      }
      q = j;
    }
    int ind = 1;
    int o = m + 1;
    while (ind <= q) {
      p[min(o - 1, a[i].second / ind) + 1] -= 1;
      p[max(q, (a[i].first - 1) / ind) + 1] += 1;
      o = max(q, (a[i].first - 1) / ind) + 1;
      ind++;
    }
  }
  int res = 0;
  for (int i = 1; i < p.size() - 1; i++) {
    res += p[i];
    cout << res << endl;
  }
  return 0;
}
