#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll N, M;
int main() {
  cin >> N >> M;
  vector<P> A(N);
  for (int i = 0; i < N; i++) {
    ll l, r;
    cin >> l >> r;
    P p(r, l);
    A[i] = p;
  }
  P p1(10000000000, 10000000000);
  A.push_back(p1);
  sort(A.begin(), A.end());
  vector<ll> ans(M + 1);
  for (int i = 1; i <= M; i++) {
    ll sum = 0;
    ll J = 0;
    for (int j = 0; j * i <= M; j++) {
      if (J != N && A[J].first < i * (j + 1)) {
        while (J != N && A[J].first < i * (j + 1)) {
          if (A[J].second <= i * j) sum++;
          J++;
        }
      }
    }
    ans[i] = sum;
  }
  for (int i = 1; i <= M; i++) cout << ans[i] << endl;
  return 0;
}
