#include <bits/stdc++.h>
using namespace std;
long long int INF = 1e18;
long long int mod = 1000000007;
double Pi = 3.1415926535897932384626;
vector<long long> G[500005];
vector<pair<long long, long long> > tree[500010];
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    pqps;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "RULD";
long long rui(long long number1, long long number2) {
  if (number2 == 0) {
    return 1;
  } else {
    long long number3 = rui(number1, number2 / 2);
    number3 *= number3;
    number3 %= mod;
    if (number2 % 2 == 1) {
      number3 *= number1;
      number3 %= mod;
    }
    return number3;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
long long i, j, k, ii, jj;
long long n, m;
long long a, b, c, d, e, g, h;
long long ans, num;
long long x[500005], y[500005], z[500005];
long long l[500005], r[500005];
bool dame, flag;
bool check[500005];
char s[500005], t[500005];
int main() {
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    cin >> l[i] >> r[i];
  }
  for (i = 0; i < n; i++) {
    num = 1;
    long long ba = INF, bb = INF;
    if (l[i] == r[i]) {
      x[l[i]] += 1;
      x[l[i] + 1] -= 1;
      if (l[i] != 1) {
        x[1] += 1;
        x[2] -= 1;
      }
    } else {
      while (1) {
        if (num >= 2) {
          ba = a;
          bb = b;
        }
        a = (l[i] + num - 1) / num;
        b = (r[i]) / num;
        b = min(b, ba - 1);
        a = min(a, b);
        if (b == 0) break;
        x[a] += 1;
        x[b + 1] -= 1;
        if (b <= r[i] - l[i]) break;
        num++;
      }
      if (a >= 2) {
        x[1] += 1;
        x[a] -= 1;
      }
    }
  }
  for (i = 1; i <= m; i++) {
    x[i] += x[i - 1];
    cout << x[i] << endl;
    ;
  }
  return 0;
}
