#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
template <class T>
inline T isqrt(T k) {
  T r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
template <class T>
inline T icbrt(T k) {
  T r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 300000 + 5;
const int magic = 320;
int n, m;
int l[maxn];
int r[maxn];
long long cnt[maxn];
long long ans[maxn];
void solve() {
  cin >> n >> m;
  for (int i = (0); i < (n); i++) {
    cin >> l[i] >> r[i];
    cnt[l[i]]++, cnt[r[i] + 1]--;
  }
  for (int i = (1); i < (m + 1); i++) {
    cnt[i] += cnt[i - 1];
  }
  for (int i = (1); i < (m + 1); i++) {
    for (int j = i; j <= m; j += i) {
      ans[i] += cnt[j];
    }
  }
  memset(cnt, 0, sizeof(cnt));
  for (int i = (0); i < (n); i++) {
    for (int j = (1); j < (magic); j++) {
      int x = r[i] / j - (l[i] - 1) / j;
      if (x > 0) {
        ans[j] -= x - 1;
      }
    }
    for (int j = (1); j < (magic); j++) {
      int lo = r[i] / (j + 1) + 1;
      int hi = r[i] / j;
      chkmax(lo, magic);
      if (lo <= hi) {
        cnt[lo] -= j - 1;
        cnt[hi + 1] += j - 1;
      }
      if (l[i]) {
        lo = (l[i] - 1) / (j + 1) + 1;
        hi = (l[i] - 1) / j;
        chkmax(lo, magic);
        if (lo <= hi) {
          cnt[lo] += j - 1;
          cnt[hi + 1] -= j - 1;
        }
      }
    }
  }
  for (int i = (1); i < (m + 1); i++) {
    cnt[i] += cnt[i - 1];
    ans[i] += cnt[i];
  }
  for (int i = (1); i < (m + 1); i++) cout << ans[i] << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
