#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 0x3b800001;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<pii> four = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
__attribute__((constructor)) void SETTINGS() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
};
template <class T>
inline constexpr T gcd(T a, T b) {
  if (!a || !b) return 0;
  return a % b ? gcd(b, a % b) : b;
}
template <class T>
inline constexpr T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
template <class T>
inline constexpr T min(vector<T>& v) {
  return *min_element((v).begin(), (v).end());
}
inline char min(string& v) { return *min_element((v).begin(), (v).end()); }
template <class T>
inline constexpr T max(vector<T>& v) {
  return *max_element((v).begin(), (v).end());
}
inline char max(string& v) { return *max_element((v).begin(), (v).end()); }
inline ll pow(ll a, ll b) {
  if (b == 0) return 1;
  ll ans = pow(a, b / 2);
  return ans * ans * (b & 1 ? a : 1);
}
inline ll modpow(ll a, ll b, ll mod) {
  if (b == 0) return 1;
  ll ans = pow(a, b / 2);
  return ans * ans * (b & 1 ? a : 1) % mod;
}
template <typename T>
inline bool update_min(T& mn, const T& cnt) {
  if (mn > cnt) {
    mn = cnt;
    return 1;
  } else
    return 0;
}
template <typename T>
inline bool update_max(T& mx, const T& cnt) {
  if (mx < cnt) {
    mx = cnt;
    return 1;
  } else
    return 0;
}
inline void in() {}
template <class T>
istream& operator>>(istream& is, vector<T>& vec);
template <class T, size_t size>
istream& operator>>(istream& is, array<T, size>& vec);
template <class T, class L>
istream& operator>>(istream& is, pair<T, L>& p);
template <class T>
ostream& operator<<(ostream& os, vector<T>& vec);
template <class T, class L>
ostream& operator<<(ostream& os, pair<T, L>& p);
template <class T>
istream& operator>>(istream& is, vector<T>& vec) {
  for (T& x : vec) is >> x;
  return is;
}
template <class T, class L>
istream& operator>>(istream& is, pair<T, L>& p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <class T>
ostream& operator<<(ostream& os, vector<T>& vec) {
  os << vec[0];
  for (ll i = 1; i < vec.size(); ++i) {
    os << ' ' << vec[i];
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, deque<T>& deq) {
  os << deq[0];
  for (ll i = 1; i < deq.size(); ++i) {
    os << ' ' << deq[i];
  }
  return os;
}
template <class T, class L>
ostream& operator<<(ostream& os, pair<T, L>& p) {
  os << p.first << " " << p.second;
  return os;
}
template <class T, class L>
pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
  return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head&& head, Tail&&... tail) {
  cin >> head;
  in(move(tail)...);
}
template <class T>
inline bool out(T t) {
  cout << t << '\n';
  return 0;
}
inline bool out() {
  cout << '\n';
  return 0;
}
template <class Head, class... Tail>
inline bool out(Head head, Tail... tail) {
  cout << head << ' ';
  out(move(tail)...);
  return 0;
}
template <class T>
inline void err(T t) {
  cerr << t << '\n';
}
inline void err() { cerr << '\n'; }
template <class Head, class... Tail>
inline void err(Head head, Tail... tail) {
  cerr << head << ' ';
  out(move(tail)...);
}
struct LazySegmentTree {
 public:
  ll size;
  vector<ll> data, lazy;
  LazySegmentTree(ll n) {
    size = 1;
    while (size < n) size *= 2;
    data = lazy = vector<ll>(size * 2);
  }
  void add(ll l, ll r, ll val) {
    l += size;
    r += size;
    while (l < r) {
      if (l & 1) {
        lazy[l] += val;
        data[l] += val;
        ll a = l++;
        while (a /= 2) data[a] += val;
      }
      if (r & 1) {
        lazy[--r] += val;
        data[r] += val;
        ll a = r;
        while (a /= 2) data[a] += val;
      }
      l /= 2;
      r /= 2;
      val *= 2;
    }
  }
};
signed main() {
  ll n, m;
  in(n, m);
  vector<pll> a(n);
  in(a);
  auto seg = LazySegmentTree(m + 1);
  for (auto&& i : a) {
    ll mx = m + 1, sq = sqrt(i.second);
    for (ll j = 1; j < sq + 1; ++j) {
      seg.add(max((i.first + j - 1) / j, j), min(i.second / j + 1, mx), 1);
      mx = (i.first + j - 1) / j;
      if (mx <= j) break;
      if (i.second / j > (i.first - 1) / j) seg.add(j, j + 1, 1);
    }
    for (ll i = 1; i < seg.size; ++i)
      if (seg.lazy[i]) {
        seg.data[i * 2] += seg.lazy[i] / 2;
        seg.data[i * 2 + 1] += seg.lazy[i] / 2;
        seg.lazy[i * 2] += seg.lazy[i] / 2;
        seg.lazy[i * 2 + 1] += seg.lazy[i] / 2;
        seg.lazy[i] = 0;
      }
  }
  for (ll i = 1; i < seg.size; ++i)
    if (seg.lazy[i]) {
      seg.data[i * 2] += seg.lazy[i] / 2;
      seg.data[i * 2 + 1] += seg.lazy[i] / 2;
      seg.lazy[i * 2] += seg.lazy[i] / 2;
      seg.lazy[i * 2 + 1] += seg.lazy[i] / 2;
    }
  for (ll i = seg.size + 1; i < seg.size + m + 1; ++i) out(seg.data[i]);
}
