#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, ans = 0;
  cin >> n >> m;
  vector<pair<long long, long long> > a(n);
  vector<long long> flag(m);
  for (int i = 0; i < (n); ++i) {
    cin >> a[i].first >> a[i].second;
  }
  sort((a).begin(), (a).end());
  for (int d = 1; d <= m; d++) {
    for (int i = 0; i < (m); ++i) flag[i] = 0;
    ans = 0;
    for (int i = 0; i <= m; i += d) {
      for (int k = 0; k < (n); ++k) {
        if (a[k].first <= i && a[k].second >= i && flag[k] == 0) {
          flag[k] = 1;
          ans++;
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
