#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  int X;
  cin >> X;
  vector<int> A(N), B(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i] >> B[i];
  }
  vector<int> L(X + 1, 0);
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < B[i]; j++) {
      if (A[i] + j <= X) {
        L[A[i] + j] = max(B[i] - j, L[A[i] + j]);
      }
      if (A[i] - j >= 1) {
        L[A[i] - j] = max(B[i] - j, L[A[i] - j]);
      }
    }
  }
  for (int i = 1; i <= X; i++) {
    cout << L[i] << " \n"[i == X];
  }
  return 0;
}