#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::string;
void __Check(bool condition, const char* expression, int line) {
  if (!condition) {
    fprintf(stderr, "Check failed at line %d: %s\n", line, expression);
    exit(-1);
  }
}
template <class Collection, class Key>
bool ContainsKey(const Collection& collection, const Key& key) {
  return collection.find(key) != collection.end();
}
const int INF = 0x3F3F3F3F;
const long long INF64 = 0x3F3F3F3F3F3F3F3F;
const int INIT = -1;
int n, m, k;
std::vector<std::pair<int, int> > g[4];
int pos[4];
void Solve() {
  int need1 = std::max(0, k - ((int)g[1].size()));
  int need2 = std::max(0, k - ((int)g[2].size()));
  int need3 = std::max(need1, need2);
  if (need3 > ((int)g[3].size())) {
    cout << "-1" << endl;
    return;
  }
  int want3 = std::min(((int)g[3].size()), k);
  int cnt = want3;
  int sum = 0;
  for (; pos[3] < want3; pos[3]++) {
    sum += g[3][pos[3]].first;
  }
  for (int i = want3; i < k; i++) {
    sum += g[1][pos[1]++].first;
    sum += g[2][pos[2]++].first;
    cnt += 2;
  }
  for (int i = 0; i < 4; i++) {
    g[i].push_back({INF, INF});
  }
  for (; cnt < m; cnt++) {
    if (pos[3] > 0) {
      int last3 = g[3][pos[3] - 1].first;
      int next12 = g[1][pos[1]].first + g[2][pos[2]].first;
      if (last3 > next12) {
        pos[3]--;
        pos[1]++;
        pos[2]++;
        sum -= last3;
        sum += next12;
        continue;
      }
    }
    int ar[] = {g[0][pos[0]].first, g[1][pos[1]].first, g[2][pos[2]].first,
                g[3][pos[3]].first};
    int mi = std::min_element(ar, ar + 4) - ar;
    sum += g[mi][pos[mi]++].first;
  }
  cout << sum << endl;
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < pos[i]; j++) {
      cout << g[i][j].second + 1 << " ";
    }
  }
  cout << endl;
}
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    int t, x, y;
    cin >> t >> x >> y;
    int idx = (x << 1) | y;
    g[idx].push_back({t, i});
  }
  for (int i = 0; i < 4; i++) {
    std::sort((g[i]).begin(), (g[i]).end());
  }
  Solve();
}
