#include <bits/stdc++.h>
using namespace std;
const int N = 300010;
int n, m, ql, qr, sum[N], ans[N];
int main() {
  scanf("%d%d", &m, &n);
  while (m--) {
    memset(sum, 0, sizeof(sum));
    scanf("%d%d", &ql, &qr);
    for (int i = 1; i <= qr;) {
      int d = qr / i, j = qr / d, k = (ql - 1) / d;
      ans[max(k + 1, i)]++;
      ans[j + 1]--;
      i = j + 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    ans[i] += ans[i - 1];
    printf("%d\n", ans[i]);
  }
  return 0;
}
