#include <bits/stdc++.h>
using namespace std;
 
#ifdef _LOCAL_
	#define cout cerr
#endif
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define FORalld(it, a) for (__typeof((a).rbegin()) it = (a).rbegin(); it != (a).rend(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll 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 (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}

template<class T> struct RangeFenwick {
	int n;
	vector<T> fen[2];
	RangeFenwick(int n) {
		this->n = n;
		fen[0].resize(n + 1);
		fen[1].resize(n + 1);
	}
	void upd(int p, T val) {
		assert(p > 0);
		for (int pp = p; pp <= n; pp += pp & -pp) {
			fen[0][pp] += val;
			fen[1][pp] += val * p;
		}
	}
	void upd(int l, int r, T val) {
		upd(l, +val), upd(r + 1, -val);
	}
	T query(int p) {
		assert(p <= n);
		T res = T(0);
		for (int pp = p; pp > 0; pp -= pp & -pp) {
			res += fen[0][pp] * (p + 1);
			res -= fen[1][pp];
		}
		return res;
	}
	T query(int l, int r) {
		return query(r) - query(l - 1);
	}
};

const int maxn = 300000 + 5;
int n, m;
int l[maxn];
int r[maxn];
long long ans[maxn];
 
void solve() {
	cin >> n >> m;
	RangeFenwick<int> rf(m);
	priority_queue<pi, vii, greater<pi> > pq;
	FOR(i, 0, n) {
		cin >> l[i] >> r[i];
		pq.push(mp(r[i] - l[i] + 1, l[i]));
		ans[1]++;
		ans[r[i] - l[i] + 2]--;
	}
	FOR(i, 1, m + 1) ans[i] += ans[i - 1];
	FOR(i, 1, m + 1) {
		while (sz(pq) && pq.top().fi < i) {
			int l = pq.top().se;
			int r = l + pq.top().fi - 1;
			pq.pop();
			rf.upd(l, r, 1);
		}
		for (int j = i; j <= m; j += i) {
			ans[i] += rf.query(j, j);
		}
	}
	FOR(i, 1, m + 1) cout << ans[i] << "\n";
}
 
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL_
	freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout);
#endif
	solve();
#ifdef _LOCAL_
	//printf("\nTime elapsed: %dms", 1000 * clock() / CLOCKS_PER_SEC);
#endif
	return 0;
}

Measured memory_bytes: 8176