#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void read(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readc(char &x) {
  char c;
  while ((c = getchar()) == ' ')
    ;
  x = c;
}
void writes(string s) { puts(s.c_str()); }
void writeln() { writes(""); }
void writei(int x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
void writell(long long x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
inline long long inc(int &x) { return ++x; }
inline long long inc(long long &x) { return ++x; }
inline long long inc(int &x, long long y) { return x += y; }
inline long long inc(long long &x, long long y) { return x += y; }
inline double inc(double &x, double y) { return x += y; }
inline long long dec(int &x) { return --x; }
inline long long dec(long long &x) { return --x; }
inline long long dec(int &x, long long y) { return x -= y; }
inline long long dec(long long &x, long long y) { return x -= y; }
inline double dec(double &x, double y) { return x -= y; }
inline long long mul(int &x) { return x = ((long long)x) * x; }
inline long long mul(long long &x) { return x = x * x; }
inline long long mul(int &x, long long y) { return x *= y; }
inline long long mul(long long &x, long long y) { return x *= y; }
inline double mul(double &x, double y) { return x *= y; }
inline long long divi(const int &x) {
  long long ans, l, r, mid;
  ans = 0;
  l = 0;
  r = 0x3fffffff;
  while (l < r) {
    mid = (l + r) / 2;
    if (mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid;
  }
  return ans;
}
inline long long divi(const long long &x) {
  long long ans, l, r, mid;
  ans = 0;
  l = 0;
  r = 0x3fffffff;
  while (l < r) {
    mid = (l + r) / 2;
    if (mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid;
  }
  return ans;
}
inline long long divi(int &x, long long y) { return x /= y; }
inline long long divi(long long &x, long long y) { return x /= y; }
inline double divi(double &x, double y) { return x /= y; }
inline long long mod(int &x, long long y) { return x %= y; }
inline long long mod(long long &x, long long y) { return x %= y; }
int n, m, i, j, k, dp[1 << 22], pre[1 << 22], s1[25], s2[25], lg[1 << 22];
struct ii {
  int l, r, len, t, id;
} a[25], b[25];
bool cmp(ii x, ii y) { return x.t < y.t; }
bool cmp2(ii x, ii y) { return x.l < y.l; }
void print() {
  int i;
  puts("YES");
  for (i = 0; i < n; i++) {
    printf("%d %d\n", s1[i], s2[i]);
  }
}
void print1(int x) {
  if (x == 0) return;
  s1[a[pre[x]].id] = 1;
  s2[a[pre[x]].id] = dp[x] - a[pre[x]].t;
  print1(x ^ (1 << (pre[x])));
}
void print2(int x) {
  if (x == 0) return;
  s1[a[pre[x]].id] = 2;
  s2[a[pre[x]].id] = dp[x] - a[pre[x]].t;
  print2(x ^ (1 << (pre[x])));
}
int lowbit(int x) { return x & (-x); }
int main() {
  read(n);
  read(m);
  for (i = 0; i < n; i++) {
    lg[1 << i] = i;
    read(a[i].l);
    read(a[i].len);
    a[i].r = a[i].l + a[i].len - 1;
    read(a[i].t);
    b[i] = a[i];
    a[i].id = i;
  }
  stable_sort(a, a + n, cmp);
  for (i = 0; i < n; i++) {
    b[a[i].id].id = i;
  }
  stable_sort(b, b + n, cmp2);
  memset(dp, 22, sizeof(dp));
  dp[0] = 1;
  for (i = 1; i < (1 << n); i++) {
    k = 0;
    int lst = 0x16161616;
    for (int j2 = i; j2; j2 -= lowbit(j2)) {
      j = lg[lowbit(j2)];
      int x = dp[i ^ (1 << j)], l2 = a[j].t;
      if (x >= lst)
        ;
      else
        k = 0;
      for (; k < n; k++) {
        if (x >= b[k].l && x <= b[k].r)
          x = b[k].r + 1;
        else if (x < b[k].l && x + l2 >= b[k].l && ((i >> b[k].id) & 1))
          x = b[k].r + 1;
        else if (x + l2 < b[k].l)
          break;
      }
      if (x + l2 <= a[j].l && dp[i] > x + l2) {
        dp[i] = x + l2;
        pre[i] = j;
      }
    }
  }
  if (m == 1) {
    if (dp[(1 << n) - 1] < 0x16161616) {
      print1((1 << n) - 1);
      print();
      return 0;
    }
    puts("NO");
    return 0;
  } else {
    for (i = 0; i < (1 << n); i++) {
      if (dp[i] < 0x16161616)
        if (dp[((1 << n) - 1) ^ i] < 0x16161616) {
          print1(i);
          print2(((1 << n) - 1) ^ i);
          print();
          return 0;
        }
    }
    puts("NO");
    return 0;
  }
  return 0;
}
