#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 55;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qp(long long a, long long b) {
  long long ans = 1;
  do {
    if (b & 1) ans = 1ll * ans * a;
    a = 1ll * a * a;
  } while (b >>= 1);
  return ans;
}
long long qp(long long a, long long b, int mo) {
  long long ans = 1;
  do {
    if (b & 1) ans = 1ll * ans * a % mo;
    a = 1ll * a * a % mo;
  } while (b >>= 1);
  return ans;
}
int main(void) {
  long long n, m;
  cin >> n >> m;
  vector<pair<long long, long long>> p(n);
  for (int i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
  }
  sort((p).begin(), (p).end());
  for (long long i = 1; i <= m; i++) {
    long long ans = 0;
    long long k = 0;
    for (long long j = 0; j <= m; j += i) {
      while (k < n and p[k].first <= j) {
        if (p[k].second >= j) ans++;
        k++;
      }
      if (k == n) break;
    }
    cout << ans << '\n';
  }
  return 0;
}
