#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<int>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  // input
  int N,X; cin >> N >> X;
  vector<int> A(N), B(N);
  for(int i = 0; i < N; i++){
    cin >> A[i] >> B[i];
    A[i]--;
  }
  // solve
  vector<int> ans(X);
  for(int i = 0; i < N; i++){
    for(int j = 0; j <= B[i]; j++){
      if(A[i] - j >= 0) chmax(ans[A[i]-j],B[i]-j);
      if(A[i] + j < X) chmax(ans[A[i]+j],B[i]-j);
    }
  }
  
  // output
  for(int i = 0; i < X; i++){
    if(i) cout << " ";
    cout << ans[i];
  } cout << endl;
}