#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const double eps = 1e-12;
const double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
long long gcd(long long a, long long b) {
  a = abs(a);
  b = abs(b);
  if (a < b) swap(a, b);
  while (b) {
    long long r = a % b;
    a = b;
    b = r;
  }
  return a;
}
void solve() {
  int n, k;
  cin >> n >> k;
  vector<long long> a(n), b(n), c(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i] >> c[i];
    c[i] *= -1;
  }
  auto isparallel = [&](int i, int j) { return a[i] * b[j] == a[j] * b[i]; };
  auto ist = [&](int i, int j, int k) -> bool {
    if (a[i] == 0) swap(i, k);
    if (a[j] == 0) swap(j, k);
    if (a[k] != 0) {
      long long x1 = b[j] * a[i] * a[k] - b[i] * a[j] * a[k];
      long long y1 = c[j] * a[i] * a[k] - c[i] * a[j] * a[k];
      long long x2 = b[k] * a[i] * a[j] - b[i] * a[j] * a[k];
      long long y2 = c[k] * a[i] * a[j] - c[i] * a[j] * a[k];
      __int128 z1 = __int128(x1) * __int128(y2);
      __int128 z2 = __int128(x2) * __int128(y1);
      return z1 == z2;
    } else {
      long long x1 = b[j] * a[i] - b[i] * a[j];
      long long y1 = c[j] * a[i] - c[i] * a[j];
      long long x2 = b[k];
      long long y2 = c[k];
      __int128 z1 = __int128(x1) * __int128(y2);
      __int128 z2 = __int128(x2) * __int128(y1);
      return z1 == z2;
    }
  };
  mt19937 mt(time(0));
  vector<vector<int>> ans;
  map<vector<int>, bool> chked[6];
  function<bool(vector<int>, int)> can = [&](vector<int> v, int c) -> bool {
    if (c >= v.size()) {
      for (int i = 0; i < v.size(); i++) {
        ans.push_back({v[i]});
      }
      return true;
    }
    if (chked[c][v]) return false;
    chked[c][v] = true;
    int d = (v.size() + c - 1) / c;
    uniform_int_distribution<> ud(0, v.size() - 1);
    for (int aa = 0; aa < 25; aa++) {
      int l = ud(mt), r = ud(mt);
      while (l == r) r = ud(mt);
      if (isparallel(l, r)) continue;
      vector<int> ids;
      vector<int> rests;
      for (int i = 0; i < v.size(); i++) {
        if (i == l || i == r) {
          ids.push_back(v[i]);
        } else {
          if (!isparallel(i, l) && !isparallel(i, r) && ist(v[i], v[l], v[r])) {
            ids.push_back(v[i]);
          } else {
            rests.push_back(v[i]);
          }
        }
      }
      if (ids.size() >= d) {
        if (can(rests, c - 1)) {
          ans.push_back(ids);
          return true;
        }
      }
    }
    return false;
  };
  vector<int> ori(n);
  for (int i = 0; i < n; i++) ori[i] = i;
  if (can(ori, k)) {
    cout << "YES\n";
    cout << ans.size() << "\n";
    for (int i = 0; i < ans.size(); i++) {
      if (ans[i].size() == 1) {
        cout << ans[i][0] + 1 << " " << -1 << "\n";
      } else {
        cout << ans[i][0] + 1 << " " << ans[i][1] + 1 << "\n";
      }
    }
  } else {
    cout << "NO\n";
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
