#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool get_int(T &x) {
  char t = getchar();
  bool neg = false;
  x = 0;
  for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
    ;
  if (t == '-') neg = true, t = getchar();
  if (t == EOF) return false;
  for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
  if (neg) x = -x;
  return true;
}
template <typename T>
void print_int(T x) {
  if (x < 0) putchar('-'), x = -x;
  short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const double pi = acos(-1.0);
const int maxn = 100111;
int k, n, m, a[maxn], op[maxn];
vector<pair<int, int> > add[maxn], mult[maxn], assign[maxn];
vector<pair<pair<long long, long long>, int> > all;
bool cmp(const pair<pair<long long, long long>, int> &a,
         const pair<pair<long long, long long>, int> &b) {
  return (a.first.first * b.first.second > b.first.first * a.first.second);
}
bool cmp2(int x, int y) { return op[x] < op[y]; }
int main() {
  (get_int(k) && (get_int(n) && get_int(m)));
  for (int i = 1; i <= k; i++) get_int(a[i]);
  for (int i = 1, tp, x, y; i <= n; i++) {
    (get_int(tp) && (get_int(x) && get_int(y)));
    op[i] = tp;
    if (tp == 1)
      assign[x].push_back(make_pair(y, i));
    else if (tp == 2)
      add[x].push_back(make_pair(y, i));
    else
      mult[x].push_back(make_pair(y, i));
  }
  for (int x = 1; x <= k; x++) {
    sort(assign[x].begin(), assign[x].end(), greater<pair<int, int> >());
    for (auto v : assign[x]) {
      if (v.first > a[x]) add[x].push_back(make_pair(v.first - a[x], v.second));
      break;
    }
    sort(add[x].begin(), add[x].end(), greater<pair<int, int> >());
    sort(mult[x].begin(), mult[x].end(), greater<pair<int, int> >());
    long long sum = a[x];
    for (auto v : add[x]) {
      all.push_back(make_pair(make_pair(v.first, sum), v.second));
      sum += v.first;
    }
    for (auto v : mult[x]) {
      if (v.first > 1)
        all.push_back(make_pair(make_pair(v.first - 1, 1), v.second));
    }
  }
  sort(all.begin(), all.end(), cmp);
  vector<int> ans;
  for (int i = 0; i < m && i < (int)all.size(); i++)
    ans.push_back(all[i].second);
  sort(ans.begin(), ans.end(), cmp2);
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < (int)ans.size(); i++)
    printf("%d%c", ans[i], i == (int)ans.size() - 1 ? '\n' : ' ');
  return 0;
}
