#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
void chmax(T &x, const T y) {
  x = (x > y ? x : y);
}
template <typename T>
void chmin(T &x, const T y) {
  x = (x < y ? x : y);
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
inline void add(T &x, const T y) {
  x = mm(x + y);
}
inline long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  if (e < 0) {
    puts("error");
    exit(666);
  }
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int N = 2e5 + 10;
struct Op {
  int op, id;
  double val;
  friend bool operator<(Op a, Op b) { return a.val > b.val; }
};
int a[N];
Op b[N];
vector<Op> c[N], ans;
void main() {
  int n = qread(), all = qread(), wt = qread();
  for (int i = (1), I = (n); i <= I; i++) a[i] = qread();
  for (int i = (1), I = (all); i <= I; i++) {
    int op = qread(), pos = qread();
    double val;
    scanf("%lf", &val);
    Op now = (Op){op, i, val};
    if (op == 1) {
      now.val -= a[pos];
      if (now < b[pos]) b[pos] = now;
    }
    if (op == 2) c[pos].push_back(now);
    if (op == 3) ans.push_back(now);
  }
  for (int i = (1), I = (n); i <= I; i++) {
    if (b[i].val > 0) c[i].push_back(b[i]);
    sort((c[i]).begin(), (c[i]).end());
    double sum = a[i];
    for (int t = (0), I = (((int)(c[i]).size()) - 1); t <= I; t++)
      ans.push_back((Op){c[i][t].op, c[i][t].id, (sum + c[i][t].val) / sum}),
          sum += c[i][t].val;
  }
  sort((ans).begin(), (ans).end());
  ans.resize(wt);
  while (((int)(ans).size()) > 0 and ans.back().val <= 0)
    ans.resize(((int)(ans).size()) - 1);
  write2(((int)(ans).size()));
  for (auto x : ans)
    if (x.op == 1) write1(x.id);
  for (auto x : ans)
    if (x.op == 2) write1(x.id);
  for (auto x : ans)
    if (x.op == 3) write1(x.id);
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::main();
}
