#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, m) for (int i = (n); i < (m); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vs = vector<string>;
using pii = pair<int, int>;
using Graph = vector<vector<int>>;

int main() {
  int N, X; cin >> N >> X;
  vi A(N), B(N);
  REP(i, N) cin >> A[i] >> B[i];
  vi ans(X);
  REP(i, X){
    int tmp = 0;
    REP(j, N){
      tmp = max(max(B[j]-abs(i+1-A[j]), 0), tmp);
    }
    ans[i] = tmp;
  }
  REP(i, X){
    if(i) cout << " " ;
    cout << ans[i];
  }
  cout << endl;
}