#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
using namespace std;
template <typename T>
void chkmax(T &x, T y) {
  x = x > y ? x : y;
}
template <typename T>
void chkmin(T &x, T y) {
  x = x > y ? y : x;
}
template <typename T>
void add(T &x, T y, T mod) {
  x = x + y > mod ? x + y - mod : x + y;
}
template <typename T>
void sub(T &x, T y, T mod) {
  x = x - y < 0 ? x - y + mod : x - y;
}
template <typename T>
void multi(T &x, T y, T mod) {
  x = 1ll * x * y % mod;
}
const int INF = (1ll << 30);
template <typename T>
void read(T &x) {
  x = 0;
  bool f = 1;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = 0;
  } while (ch > '9' || ch < '0');
  do {
    x = x * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  x = f ? x : -x;
}
template <typename T>
void write(T x) {
  if (x < 0) x = ~x + 1, putchar('-');
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const int N = 1e5 + 7;
struct Node {
  int opt, a, id;
  long long u, v;
  Node(int x = 0, int i = 0, int y = 0, long long z = 0, long long d = 0) {
    opt = x;
    id = i;
    a = y;
    u = z;
    v = d;
  }
} ret[N], s[3][N];
bool cmp1(Node x, Node y) {
  if (x.a == y.a) return x.u > y.u;
  return x.a < y.a;
}
bool cmp2(Node x, Node y) { return x.u * y.v > y.u * x.v; }
bool cmp3(Node x, Node y) {
  if (x.opt == y.opt) return x.u * y.v > y.u * x.v;
  return x.opt < y.opt;
}
int n, m, k, cnt, cnt0, cnt1, cnt2, ret0, ret1, ret2, a[N];
int main() {
  read(n);
  read(m);
  read(k);
  for (int i = 1; i <= n; i++) read(a[i]);
  for (int i = 1, opt, x, y; i <= m; i++) {
    read(opt);
    read(x);
    read(y);
    if (opt == 1 && y > a[x]) s[0][++cnt0] = Node(opt, i, x, y, 1);
    if (opt == 2) s[1][++cnt1] = Node(opt, i, x, y, 1);
    if (opt == 3) s[2][++cnt2] = Node(opt, i, x, y, 1);
  }
  sort(s[0] + 1, s[0] + cnt0 + 1, cmp1);
  for (int i = 1; i <= cnt0; i++) {
    if (s[0][i].a != s[0][i - 1].a) s[0][++ret0] = s[0][i];
  }
  cnt0 = ret0;
  for (int i = 1; i <= cnt0; i++) {
    s[1][++cnt1] =
        Node(s[0][i].opt, s[0][i].id, s[0][i].a, s[0][i].u - a[s[0][i].a], 1);
  }
  sort(s[1] + 1, s[1] + cnt1 + 1, cmp1);
  long long sum = 0;
  for (int i = 1; i <= cnt1; i++) {
    if (s[1][i].a != s[1][i - 1].a) sum = a[s[1][i].a];
    s[1][i].u = s[1][i].u;
    s[1][i].v = sum;
    sum += s[1][i].u;
  }
  for (int i = 1; i <= cnt2; i++) s[2][i].u--;
  for (int i = 1; i <= cnt1; i++) s[2][++cnt2] = s[1][i];
  sort(s[2] + 1, s[2] + cnt2 + 1, cmp2);
  int tmp = min(cnt2, k), ans = 0;
  for (int i = 1; i <= tmp; i++) ret[++ans] = s[2][i];
  sort(ret + 1, ret + ans + 1, cmp3);
  printf("%d\n", ans);
  for (int i = 1; i <= ans; i++) printf("%d ", ret[i].id);
  return 0;
}
