#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int N, M;
  cin >> N >> M;
  vector<pair<int, int> > v(N);
  for (int i = 0; i < N; i++) {
    cin >> v[i].first >> v[i].second;
  }
  sort(v.begin(), v.end());
  for (int d = 1; d <= M; d++) {
    set<int> st;
    int i = 0;
    for (int j = 1; j * d <= M; j++) {
      int now = j * d;
      int ng = distance(v.begin(),
                        upper_bound(v.begin(), v.end(), make_pair(now, M)));
      while (i < ng) {
        if (v[i].second >= now) st.insert(i);
        ++i;
      }
    }
    cout << st.size() << endl;
  }
  return 0;
}
