#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

class BIT{
public:
  vector <ll> bit;
  const int n;
  BIT(int N): bit(N,0),n(N){};
  void add(int i, ll v){
    for(; i < n; i |= i + 1){
      bit[i] += v;
    }
  }

  ll sum(int i) {//sum [0,i)
    ll res = 0;
    --i;
    for (; i >= 0; i = (i & (i+1)) - 1) {
      res += bit[i];
    }
    return res;
  }

  ll sum(int a, int b) { // sum [a,b)
    return sum(b) - sum(a);
  }

  ll get(int a) {//a番目の値を見る
    return sum(a+1) - sum(a);
  }

  void setv(int i, ll v) {//i番目の値をvにする
    add(i, v - get(i));
  }
};


//BIT終わり

int ans[100100];
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N, M;
  cin >> N >> M;
  vector <pair <int, pair<int,int>>> nums;
  rep(i,N){
    int l,r;
    cin >> l >> r;
    r++;
    nums.pb(mp(r-l, mp(l,r)));
  }
  sort(ALL(nums));
  reverse(ALL(nums));
  static BIT bit(M+10);
  for (int i = 1; i <= M; i++) {
    while (sz(nums) != 0) {
      if (nums.back().fir >= i) {
        break;
      }
      int l = nums.back().sec.fir;
      int r = nums.back().sec.sec;
      bit.add(l, 1);
      bit.add(r, -1);
      nums.pop_back();
    }
    ans[i] = sz(nums);
    for (int j = i; j <= M; j+=i) {
      ans[i] += bit.sum(j+1);
    }
  }
  for (int i = 1; i <= M; i++) {
    cout << ans[i] << endl;
  }
  
  return 0;
}



Measured memory_bytes: 6640