#include <bits/stdc++.h>
using namespace std;
using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int> >;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int> >;
template <typename T = int>
using VT = vector<T>;
template <typename T = int>
using VVT = vector<vector<T> >;
template <typename T = int>
using LIM = numeric_limits<T>;
template <typename T>
inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}
template <typename T>
inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T>
inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline int chl(const int k) { return k * 2 + 1; }
inline int chr(const int k) { return k * 2 + 2; }
inline int mid(const int l, const int r) { return (l + r) / 2; }
namespace SegmentTree {
class RangeAdd_GetValue {
  const int N;
  vector<long long> dat_add;

 public:
  RangeAdd_GetValue(const int n) : N(n), dat_add(N * 4) {}
  void add(const int a, const int b, const int x) {
    return add(a, b, x, 0, 0, N);
  }
  void add(const int a, const int b, const int x, int k, const int l,
           const int r) {
    if (b <= l || r <= a) {
      return;
    } else if (a <= l && r <= b) {
      dat_add[k] += x;
    } else {
      add(a, b, x, chl(k), l, mid(l, r));
      add(a, b, x, chr(k), mid(l, r), r);
    }
    return;
  }
  int value(const int p) { return value(p, 0, 0, N); }
  int value(const int p, const int k, const int l, const int r) {
    if (l == p && l + 1 == r) {
      return dat_add[k];
    } else if (l <= p && p < r) {
      return (dat_add[k] + value(p, chl(k), l, mid(l, r))) +
             value(p, chr(k), mid(l, r), r);
    } else {
      return 0;
    }
  }
};
}  // namespace SegmentTree
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;
  int N, M;
  scanf("%d%d", &N, &M);
  static int L[1 << 17], R[1 << 17];
  for (int i = (int)(0); i < (int)(N); ++i) {
    scanf("%d%d", L + i, R + i);
    ++R[i];
  }
  VVI intervals(M + 1);
  for (int i = (int)(0); i < (int)(N); ++i) {
    const int l = R[i] - L[i];
    intervals[l].push_back(i);
  }
  SegmentTree::RangeAdd_GetValue segtree(M + 2);
  int longer = N;
  for (int w = (int)(1); w < (int)(M + 1); ++w) {
    int res = longer;
    for (int i = 0; i <= M; i += w) {
      res += segtree.value(i);
    }
    printf("%d\n", res);
    for (auto &&i : intervals[w]) {
      --longer;
      segtree.add(L[i], R[i], 1);
    }
  }
  fflush(stdout);
  return 0;
}
