#include <bits/stdc++.h>
using T = std::pair<int, int>;
T *P = new T[1 << 19], *p;
int BIT[1 << 17], j, k, l, r, x, M;
int main() {
  p = P;
  while (~scanf("%d%d", &p->first, &p->second)) p++;
  M = P->second;
  ++P;
  sort(P, p, [](T a, T b) { return a.second - a.first < b.second - b.first; });
  --p;
  while (x++ < M) {
    while (std::tie(l, r) = *P, l && r - l < x) {
      for (j = l; j <= M; j += j & -j) BIT[j]++;
      for (j = r + 1; j <= M; j += j & -j) BIT[j]--;
      P++;
    }
    k = p - P;
    for (j = 0; j <= M; j += x) {
      for (l = j; l; l -= l & -l) k += BIT[l];
    }
    printf("%d\n", k + 1);
  }
  j = 0;
}
