#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
  i >> p.first >> p.second;
  return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
  for (auto& v : t) {
    i >> v;
  }
  return i;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {
  o << p.first << ' ' << p.second;
  return o;
}
template <typename T>
std::ostream& operator<<(std::ostream& o, const vector<T>& t) {
  if (t.empty()) o << '\n';
  for (size_t i = 0; i < t.size(); ++i) {
    o << t[i] << " \n"[i == t.size() - 1];
  }
  return o;
}
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
bool in(T a, T b, T c) {
  return a <= b && b < c;
}
unsigned int logceil(long long first) {
  return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;
}
namespace std {
template <typename T, typename U>
struct hash<pair<T, U>> {
  hash<T> t;
  hash<U> u;
  size_t operator()(const pair<T, U>& p) const {
    return t(p.first) ^ (u(p.second) << 7);
  }
};
}  // namespace std
template <typename T, typename F>
T bsh(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      l = m + 1;
      r = m;
    } else {
      h = m - 1;
    }
  }
  return r;
}
template <typename F>
double bshd(double l, double h, const F& f, double p = 1e-9) {
  unsigned int r = 3 + (unsigned int)log2((h - l) / p);
  while (r--) {
    double m = (l + h) / 2;
    if (f(m)) {
      l = m;
    } else {
      h = m;
    }
  }
  return (l + h) / 2;
}
template <typename T, typename F>
T bsl(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      h = m - 1;
      r = m;
    } else {
      l = m + 1;
    }
  }
  return r;
}
template <typename F>
double bsld(double l, double h, const F& f, double p = 1e-9) {
  unsigned int r = 3 + (unsigned int)log2((h - l) / p);
  while (r--) {
    double m = (l + h) / 2;
    if (f(m)) {
      h = m;
    } else {
      l = m;
    }
  }
  return (l + h) / 2;
}
template <typename T>
T gcd(T a, T b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
template <typename T>
class vector2 : public vector<vector<T>> {
 public:
  vector2() {}
  vector2(size_t a, size_t b, T t = T())
      : vector<vector<T>>(a, vector<T>(b, t)) {}
};
template <typename T>
class vector3 : public vector<vector2<T>> {
 public:
  vector3() {}
  vector3(size_t a, size_t b, size_t c, T t = T())
      : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}
};
template <typename T>
class vector4 : public vector<vector3<T>> {
 public:
  vector4() {}
  vector4(size_t a, size_t b, size_t c, size_t d, T t = T())
      : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}
};
template <typename T>
class vector5 : public vector<vector4<T>> {
 public:
  vector5() {}
  vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())
      : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}
};
class FPassports {
 public:
  void solve(istream& cin, ostream& cout) {
    int N, P;
    cin >> N >> P;
    vector<pair<std::pair<int, int>, std::pair<int, int>>> T(N);
    for (int i = 0; i < N; ++i) {
      cin >> T[i].first.first >> T[i].first.second >> T[i].second.first;
      T[i].second.second = i;
    }
    sort(T.begin(), T.end());
    int inf = 2e9;
    vector<pair<int, std::pair<int, int>>> W(1 << N, {inf, {-1, 0}});
    vector2<int> Bad(N, N, 0);
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < N; ++j) {
        for (int k = 0; k < N; ++k) {
          int apply = T[j].first.first + T[j].first.second;
          int passBack = apply + T[i].second.first;
          if (apply <= T[k].first.first && T[k].first.first <= passBack) {
            Bad[i][j] |= 1 << k;
          }
        }
      }
    }
    W[0].first = 1;
    for (int b = 0; b < (1 << N); ++b) {
      if (W[b].first == inf) continue;
      int first = 0;
      while (first < N &&
             (T[first].first.first + T[first].first.second < W[b].first))
        ++first;
      int bar = first;
      while (bar < N &&
             T[bar].first.first + T[bar].first.second - 1 < W[b].first)
        ++bar;
      bool canApplyRightAway = !(bar < N && T[bar].first.first <= W[b].first);
      int earliestAfter = first;
      while (earliestAfter < N && (T[earliestAfter].first.first < W[b].first ||
                                   ((b & (1 << earliestAfter)) == 0)))
        ++earliestAfter;
      for (int g = first; g < N; ++g) {
        if (b & (1 << g)) continue;
        int apply = W[b].first;
        int passBack = apply + T[g].second.first;
        if (T[g].first.first <= passBack) continue;
        if (canApplyRightAway && !(earliestAfter != N &&
                                   W[b].first <= T[earliestAfter].first.first &&
                                   T[earliestAfter].first.first <= passBack)) {
          W[b | (1 << g)] = min(W[b | (1 << g)], {passBack, {g, apply}});
        } else {
          int foo = first;
          for (int k = first; k < N; ++k) {
            int apply = T[k].first.first + T[k].first.second;
            int passBack = apply + T[g].second.first;
            if (T[g].first.first <= passBack) break;
            if (k != N - 1 && T[k + 1].first.first == apply) continue;
            if (b & Bad[g][k]) continue;
            W[b | (1 << g)] = min(W[b | (1 << g)], {passBack, {g, apply}});
            break;
          }
        }
      }
    }
    vector<std::pair<int, int>> Ans(N);
    if (P == 1) {
      if (W[(1 << N) - 1].first == inf) {
        cout << "NO\n";
        return;
      } else {
        int m = (1 << N) - 1;
        while (m != 0) {
          Ans[T[W[m].second.first].second.second] = {1, W[m].second.second};
          m ^= 1 << W[m].second.first;
        }
      }
    }
    if (P == 2) {
      bool found = false;
      for (int m = 0; m < (1 << N); ++m) {
        int c = ((1 << N) - 1) ^ m;
        if (W[m].first != inf && W[c].first != inf) {
          while (m != 0) {
            Ans[T[W[m].second.first].second.second] = {1, W[m].second.second};
            m ^= 1 << W[m].second.first;
          }
          while (c != 0) {
            Ans[T[W[c].second.first].second.second] = {2, W[c].second.second};
            c ^= 1 << W[c].second.first;
          }
          found = true;
          break;
        }
      }
      if (!found) {
        cout << "NO\n";
        return;
      }
    }
    cout << "YES\n";
    for (std::pair<int, int> ans : Ans) cout << ans << endl;
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  FPassports solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
