Problem: One Khanate had a lot of roads and very little wood. Riding along the roads was inconvenient, because the roads did not have road signs indicating the direction to important cities.

The Han decided that it's time to fix the issue, and ordered to put signs on every road. The Minister of Transport has to do that, but he has only k signs. Help the minister to solve his problem, otherwise the poor guy can lose not only his position, but also his head.

More formally, every road in the Khanate is a line on the Oxy plane, given by an equation of the form Ax + By + C = 0 (A and B are not equal to 0 at the same time). You are required to determine whether you can put signs in at most k points so that each road had at least one sign installed.

Input

The input starts with two positive integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 5)

Next n lines contain three integers each, Ai, Bi, Ci, the coefficients of the equation that determines the road (|Ai|, |Bi|, |Ci| ≤ 105, Ai2 + Bi2 ≠ 0).

It is guaranteed that no two roads coincide.

Output

If there is no solution, print "NO" in the single line (without the quotes).

Otherwise, print in the first line "YES" (without the quotes).

In the second line print a single number m (m ≤ k) — the number of used signs. In the next m lines print the descriptions of their locations.

Description of a location of one sign is two integers v, u. If u and v are two distinct integers between 1 and n, we assume that sign is at the point of intersection of roads number v and u. If u = - 1, and v is an integer between 1 and n, then the sign is on the road number v in the point not lying on any other road. In any other case the description of a sign will be assumed invalid and your answer will be considered incorrect. In case if v = u, or if v and u are the numbers of two non-intersecting roads, your answer will also be considered incorrect.

The roads are numbered starting from 1 in the order in which they follow in the input.

Examples

Input

3 1
1 0 0
0 -1 0
7 -93 0


Output

YES
1
1 2


Input

3 1
1 0 0
0 1 0
1 1 3


Output

NO


Input

2 3
3 4 5
5 6 7


Output

YES
2
1 -1
2 -1

Note

Note that you do not have to minimize m, but it shouldn't be more than k.

In the first test all three roads intersect at point (0,0).

In the second test all three roads form a triangle and there is no way to place one sign so that it would stand on all three roads at once.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int N = 110000;
int i, j, k, l, K, m, n, o, p, S[N], tot, U[10], V[10], T[N];
inline int sn(double x) { return x < -eps ? -1 : x > eps ? 1 : 0; }
struct arr {
  double A, B, C;
} L[N];
inline void Init() {
  srand(time(0));
  scanf("%d%d", &n, &k);
  int a, b, c;
  for (i = 1; i <= n; i++) {
    scanf("%d%d%d", &a, &b, &c);
    L[i].A = a;
    L[i].B = b;
    L[i].C = c;
    S[++tot] = i;
  }
}
double x, y, k1, k2, d1, d2;
inline int get(int u, int v) {
  double a1, a2, b1, b2, c1, c2;
  a1 = L[u].A;
  b1 = L[u].B;
  c1 = L[u].C;
  a2 = L[v].A;
  b2 = L[v].B;
  c2 = L[v].C;
  if (sn(b1)) {
    k1 = -a1 / b1;
    d1 = -c1 / b1;
    if (sn(b2)) {
      k2 = -a2 / b2;
      d2 = -c2 / b2;
      if (sn(k1 - k2)) {
        x = (d2 - d1) / (k1 - k2);
        y = k1 * x + d1;
      } else
        return 0;
    } else {
      x = (-c2 / a2);
      y = k1 * x + d1;
    }
  } else {
    if (sn(b2)) {
      k2 = -a2 / b2;
      d2 = c2 / b2;
      x = -c1 / a1;
      y = k2 * x + d2;
    } else
      return 0;
  }
  return 1;
}
inline int cul(int u, int v) {
  int i, ans = 0;
  if (get(S[u], S[v])) {
    for (i = 1; i <= tot; i++)
      if (!sn(L[S[i]].A * x + L[S[i]].B * y + L[S[i]].C)) ans++;
    return ans;
  } else
    return 0;
}
inline int Solve() {
  int lst, find;
  K = 0;
  while (tot && (K < k)) {
    lst = tot / (k - K);
    find = 0;
    if (tot > 1) {
      for (i = 1; i <= 50; i++) {
        o = p = 1;
        while (o == p) {
          o = rand() % tot + 1;
          p = rand() % tot + 1;
        }
        if (cul(o, p) >= lst) {
          find = 1;
          break;
        }
      }
      if (!find) break;
      K++;
      U[K] = S[o];
      V[K] = S[p];
      l = 0;
      for (i = 1; i <= tot; i++)
        if (sn(L[S[i]].A * x + L[S[i]].B * y + L[S[i]].C)) {
          l++;
          T[l] = S[i];
        }
      tot = l;
      for (i = 1; i <= tot; i++) S[i] = T[i];
    } else {
      K++;
      V[K] = -1;
      U[K] = S[1];
      tot--;
    }
  }
  if (!tot) return 1;
  if (tot <= k - K) {
    for (i = 1; i <= tot; i++) {
      K++;
      V[K] = -1;
      U[K] = S[i];
    }
    return 1;
  }
  return 0;
}
int main() {
  Init();
  if (Solve()) {
    puts("YES");
    printf("%d\n", K);
    for (i = 1; i <= K; i++) printf("%d %d\n", U[i], V[i]);
  } else
    puts("NO");
  return 0;
}