#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
const int N = 100010;
int a[N], mx[N], id[N], I[N], B[N], typ[N];
vector<int> add[N];
vector<pair<double, int> > mul;
bool cmp(int a, int b) { return B[a] > B[b]; }
bool cmpp(int a, int b) { return typ[a] < typ[b]; }
int main() {
  int n, m, k;
  gn(n, m, k);
  for (int i = 1; i <= n; i++) gn(a[i]);
  for (int i = 1; i <= m; i++) {
    gn(typ[i], id[i], B[i]);
    if (typ[i] == 1) {
      B[i] -= a[id[i]];
      if (B[i] > mx[id[i]]) mx[id[i]] = B[i], I[id[i]] = i;
    } else if (typ[i] == 2) {
      add[id[i]].push_back(i);
    } else
      mul.push_back(pair<double, int>(-B[i], i));
  }
  for (int i = 1; i <= n; i++) {
    if (mx[i] > 0) add[i].push_back(I[i]);
    sort(add[i].begin(), add[i].end(), cmp);
    long long crr = a[i];
    for (int j = 0; j < add[i].size(); j++) {
      int r = add[i][j];
      mul.push_back(pair<double, int>(-1. * (crr + B[r]) / crr, r));
      crr += B[r];
    }
  }
  vector<int> ans;
  sort(mul.begin(), mul.end());
  for (int i = 0; i < mul.size() && i < k; i++) ans.push_back(mul[i].second);
  sort(ans.begin(), ans.end(), cmpp);
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
  return 0;
}
