#include <bits/stdc++.h>
#define int long long
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

template <class T> using min_pq = priority_queue<T, vector<T>, greater<T>>;

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbMaisons, maxParJour;
  cin >> nbMaisons >> maxParJour;

  vector<pair<int, int>> maisons(nbMaisons);
  for (auto &[a, b] : maisons)
    cin >> a >> b;

  vector<vector<int>> surJour(32);
  for (int i = 0; i < nbMaisons; ++i)
    surJour[maisons[i].first].push_back(i);

  vector<int> sol(nbMaisons, -1);
  min_pq<pair<int, int>> dispo;
  for (int jour = 1; jour < 32; ++jour) {
    for (int i : surJour[jour])
      dispo.emplace(maisons[i].second, i);

    for (int i = 0; i < maxParJour and !dispo.empty(); ++i) {
      auto [j, maison] = dispo.top();
      dispo.pop();
      assert(j >= jour);
      sol[maison] = jour;
    }
  }
  for (int x : sol)
    cout << x << '\n';
}