Problem: Gleb is a famous competitive programming teacher from Innopolis. He is planning a trip to N programming camps in the nearest future. Each camp will be held in a different country. For each of them, Gleb needs to apply for a visa. 

For each of these trips Gleb knows three integers: the number of the first day of the trip si, the length of the trip in days leni, and the number of days ti this country's consulate will take to process a visa application and stick a visa in a passport. Gleb has P (1 ≤ P ≤ 2) valid passports and is able to decide which visa he wants to put in which passport.

For each trip, Gleb will have a flight to that country early in the morning of the day si and will return back late in the evening of the day si + leni - 1.

To apply for a visa on the day d, Gleb needs to be in Innopolis in the middle of this day. So he can't apply for a visa while he is on a trip, including the first and the last days. If a trip starts the next day after the end of the other one, Gleb can't apply for a visa between them as well. The earliest Gleb can apply for a visa is day 1.

After applying for a visa of country i on day d, Gleb will get his passport back in the middle of the day d + ti. Consulates use delivery services, so Gleb can get his passport back even if he is not in Innopolis on this day. Gleb can apply for another visa on the same day he received his passport back, if he is in Innopolis this day. 

Gleb will not be able to start his trip on day si if he doesn't has a passport with a visa for the corresponding country in the morning of day si. In particular, the passport should not be in another country's consulate for visa processing.

Help Gleb to decide which visas he needs to receive in which passport, and when he should apply for each visa. 

Input

In the first line of the input there are two integers N (1 ≤ N ≤ 22) and P (1 ≤ P ≤ 2)—the number of trips and the number of passports Gleb has, respectively.

The next N lines describe Gleb's trips. Each line contains three positive integers si, leni, ti (1 ≤ si, leni, ti ≤ 109)—the first day of the trip, the length of the trip and number of days the consulate of this country needs to process a visa application. It is guaranteed that no two trips intersect.

Output

If it is impossible to get all visas on time, just print "NO" (quotes for clarity). Otherwise, print "YES" and N lines describing trips. For each trip, first print number of the passport Gleb should put this country's visa in, and then print number of the day he should apply for it. Print trips in the same order as they appear in the input. Days are numbered from 1, starting with tomorrow—the first day you can apply for a visa. Passports are numbered from 1 to P.

If there are several possible answers, print any of them.

Examples

Input

2 1
3 1 1
6 1 1


Output

YES
1 1
1 4


Input

3 1
13 2 2
7 3 1
19 3 4


Output

YES
1 10
1 1
1 2


Input

7 2
15 1 1
14 1 1
18 1 1
21 1 1
9 4 6
22 2 5
5 4 3


Output

YES
2 13
1 1
1 16
1 19
1 2
2 16
2 1


Input

3 1
7 3 1
13 2 3
19 3 4


Output

NO

Note

Examples with answer "YES" are depicted below.

Each cell of the stripe represents a single day. Rectangles represent trips, each trip starts in the morning and ends in the evening. Rectangles with angled corners represent visa applications. Each application starts in the middle of a day and ends ti days after. The trip and the visa application for the same country have the same color.

In examples with two passports, visa applications and trips depicted above the time stripe are made using the first passport, visa applications and trips depicted below the time stripe are made using the second passport.

Example 1: 

<image>

Example 2: 

<image>

Example 3: 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
char buf[25];
const int inf = 0x3f3f3f3f;
const int maxn = 23;
struct node {
  int l, r, t, id;
} a[maxn], c[maxn];
struct answer {
  int type, l, id;
} q[maxn];
vector<int> v[1 << maxn], tmp;
int f[1 << 22], pre[1 << 22], g[1 << 22], w[maxn];
int n, m, type;
int read() {
  int x = 0, f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = 1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return f ? -x : x;
}
void write(int x) {
  if (!x) {
    putchar('0');
    return;
  }
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  int cnt = 0;
  while (x) {
    buf[++cnt] = '0' + x % 10;
    x /= 10;
  }
  for (int i = cnt; i >= 1; --i) putchar(buf[i]);
}
bool cmp(node x, node y) { return x.t < y.t; }
bool cmp2(node x, node y) { return x.l < y.l; }
bool cmp3(answer x, answer y) { return x.id < y.id; }
void dfs(int x, int s) {
  if (x > n) {
    v[s] = tmp;
    return;
  }
  dfs(x + 1, s);
  tmp.push_back(a[x].id);
  dfs(x + 1, s + w[a[x].id]);
  tmp.pop_back();
}
int main() {
  n = read();
  type = read();
  for (int i = 1; i <= n; ++i) {
    a[i].l = read();
    a[i].r = a[i].l + read() - 1;
    a[i].t = read();
    a[i].id = i;
    c[i] = a[i];
  }
  sort(a + 1, a + 1 + n, cmp);
  w[1] = 1;
  for (int i = 2; i <= n; ++i) w[i] = 1ll * w[i - 1] * 2;
  dfs(1, 0);
  sort(a + 1, a + 1 + n, cmp2);
  int s = (1 << n) - 1;
  for (int i = 1; i <= s; ++i) f[i] = inf;
  f[0] = 1;
  for (int i = 0; i <= s - 1; ++i) {
    if (f[i] == inf) continue;
    int sum = s - i;
    int t = f[i];
    int l1 = 1, l2 = 1;
    for (int j = 0; j < v[sum].size(); ++j) {
      bool flag = true;
      while (flag) {
        flag = false;
        while (l1 <= n && a[l1].l <= t) {
          if (t <= a[l1].r) {
            t = a[l1].r + 1;
            flag = true;
          }
          ++l1;
        }
        while (l2 <= n && a[l2].l <= t + c[v[sum][j]].t) {
          if (i & w[a[l2].id]) {
            t = max(t, a[l2].r + 1);
            flag = true;
          }
          ++l2;
        }
      }
      if (t + c[v[sum][j]].t < c[v[sum][j]].l &&
          t + c[v[sum][j]].t < f[i | w[v[sum][j]]]) {
        f[i | w[v[sum][j]]] = t + c[v[sum][j]].t;
        g[i | w[v[sum][j]]] = v[sum][j];
        pre[i | w[v[sum][j]]] = i;
      }
    }
  }
  if (type == 1) {
    if (f[s] == inf) {
      puts("NO");
      return 0;
    }
    puts("YES");
    int x = s;
    while (x) {
      q[++m] = (answer){1, f[x] - c[g[x]].t, g[x]};
      x = pre[x];
    }
    sort(q + 1, q + 1 + m, cmp3);
    for (int i = 1; i <= m; ++i) {
      write(q[i].type);
      putchar(' ');
      write(q[i].l);
      putchar('\n');
    }
  } else {
    int ans = inf, s1 = 0;
    for (int i = 0; i <= s; ++i)
      if (f[i] < inf && f[s - i] < inf && max(f[i], f[s - i]) < ans) {
        ans = max(f[i], f[s - i]);
        s1 = i;
      }
    if (ans == inf) {
      puts("NO");
      return 0;
    }
    puts("YES");
    int x = s1;
    while (x) {
      q[++m] = (answer){1, f[x] - c[g[x]].t, g[x]};
      x = pre[x];
    }
    x = s - s1;
    while (x) {
      q[++m] = (answer){2, f[x] - c[g[x]].t, g[x]};
      x = pre[x];
    }
    sort(q + 1, q + 1 + m, cmp3);
    for (int i = 1; i <= m; ++i) {
      write(q[i].type);
      putchar(' ');
      write(q[i].l);
      putchar('\n');
    }
  }
  return 0;
}