//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/dsu>
#include <boost/rational.hpp>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const double pi = 3.14159265359879323846264338327950288419;
const ll INF = 9 * 1e18;
using p = pair<ll, ll>;

int main() {
  int n, x; cin >> n >> x;
  vector<int> ans(x);
  for(int i = 0; i < n; i++){
    int a, b; cin >> a >> b;
    a--;
    for(int j = a - b; j < a+b; j++){
      if(j < 0 or j >= x) continue;
      //cerr << j << " " << b - abs(j - a) << endl;
      ans[j] = max(ans[j], b - abs(j - a));
    }
  }
  
  for(auto v : ans) cout << v << " ";
  cout << endl;
}