#include <bits/stdc++.h>
using namespace std;
const long long INFL = 1LL << 60;
const int INF = 1 << 30;
long long MOD = 998244353;
vector<long long> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<long long> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};
void BinarySay(long long x, long long y = 60) {
  for (long long i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1);
  cout << endl;
}
long long pow_long(long long x, long long k) {
  long long res = 1;
  while (k > 0) {
    if (k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
long long pow_mod(long long x, long long k) {
  long long res = 1;
  while (k > 0) {
    if (k % 2) {
      res *= x;
      res %= MOD;
    }
    x *= x;
    x %= MOD;
    k /= 2;
  }
  return res;
}
long long inverse(long long x) { return pow_mod(x, MOD - 2); };
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; };
long long kai_mod(long long x) {
  if (x == 0) return 1;
  return x * kai_mod(x - 1) % MOD;
}
vector<long long> divisor(long long n) {
  vector<long long> res(0);
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      res.push_back(i);
      if (i != n / i) res.push_back(n / i);
    }
  }
  sort(res.begin(), res.end());
  return res;
}
vector<long long> MakePrimeList(long long x) {
  vector<long long> res;
  for (long long k = 2; k * k <= x; k++) {
    if (x % k == 0) {
      res.push_back(k);
      while (x % k == 0) x /= k;
    }
  }
  if (x > 1) res.push_back(x);
  return res;
}
const int MAXcomb = 200010;
long long fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAXcomb; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long comb(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
long long N, M;
long long l[100010], r[100010];
long long ans[100010];
void solve() {
  for (long long i = 0; i < (N); i++) {
    long long used = INFL;
    for (long long b = 1; b <= M; b++) {
      long long left = (l[i] + b - 1) / b;
      long long right = min(r[i] / b, used - 1);
      used = left;
      if (left <= right) {
        ans[left]++;
        ans[right + 1]--;
      }
      if (left <= 1) break;
    }
  }
  for (long long i = 0; i < (M); i++) {
    ans[i + 1] += ans[i];
  }
  for (long long i = 1; i <= M; i++) {
    cout << ans[i] << endl;
  }
}
int main() {
  cin >> N >> M;
  for (long long i = 0; i < (N); i++) cin >> l[i] >> r[i];
  solve();
}
