#include <bits/stdc++.h>
using namespace std;
long long arr[100010], ass[100010], id[100010];
vector<pair<long long, pair<long long, double>>> add[100010], aoi;
vector<pair<long long, long long>> ans;
bool cmp(pair<long long, pair<long long, double>> a,
         pair<long long, pair<long long, double>> b) {
  return a.second.second > b.second.second;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long k, n, m, i, a, b, j, sum;
  double c;
  pair<long long, pair<long long, double>> qwq;
  cin >> k >> n >> m;
  for (i = 1; i <= k; i++) {
    cin >> arr[i];
  }
  for (i = 0; i < n; i++) {
    cin >> a >> b >> c;
    if (a == 1) {
      if (c > ass[b]) {
        ass[b] = c;
        id[b] = i;
      }
    } else if (a == 2) {
      qwq = {i, {a, c}};
      add[b].emplace_back(qwq);
    } else {
      qwq = {i, {a, c}};
      aoi.emplace_back(qwq);
    }
  }
  for (i = 1; i <= k; i++) {
    if (ass[i]) {
      qwq = {id[i], {1, ass[i] - arr[i]}};
      add[i].emplace_back(qwq);
    }
  }
  for (i = 1; i <= k; i++) {
    sort(add[i].begin(), add[i].end(), cmp);
    sum = arr[i];
    for (j = 0; j < add[i].size(); j++) {
      a = add[i][j].first;
      b = add[i][j].second.first;
      c = add[i][j].second.second;
      qwq = {a, {b, 1 + c / sum}};
      sum += c;
      aoi.emplace_back(qwq);
    }
  }
  sort(aoi.begin(), aoi.end(), cmp);
  for (i = 0; i < min(m, (long long)aoi.size()); i++) {
    if (aoi[i].second.second > 1) {
      ans.emplace_back(make_pair(aoi[i].second.first, aoi[i].first));
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (auto sana : ans) {
    cout << sana.second + 1 << ' ';
  }
  cout << '\n';
  return 0;
}
