#include <bits/stdc++.h>
const int mod = 1000000007;
const int gmod = 3;
const int inf = 1039074182;
const double eps = 1e-9;
const long long llinf = 2LL * inf * inf;
template <typename T1, typename T2>
inline void chmin(T1 &x, T2 b) {
  if (b < x) x = b;
}
template <typename T1, typename T2>
inline void chmax(T1 &x, T2 b) {
  if (b > x) x = b;
}
inline void chadd(int &x, int b) {
  x += b - mod;
  x += (x >> 31 & mod);
}
template <typename T1, typename T2>
inline void chadd(T1 &x, T2 b) {
  x += b;
  if (x >= mod) x -= mod;
}
template <typename T1, typename T2>
inline void chmul(T1 &x, T2 b) {
  x = 1LL * x * b % mod;
}
template <typename T1, typename T2>
inline void chmod(T1 &x, T2 b) {
  x %= b, x += b;
  if (x >= b) x -= b;
}
template <typename T>
inline T mabs(T x) {
  return (x < 0 ? -x : x);
}
using namespace std;
using namespace std;
template <typename T>
ostream &operator<<(ostream &cout, vector<T> vec) {
  cout << "{";
  for (int i = 0; i < (int)vec.size(); i++) {
    cout << vec[i];
    if (i != (int)vec.size() - 1) cout << ',';
  }
  cout << "}";
  return cout;
}
template <typename T>
void operator*=(vector<T> &vec, int k) {
  for (auto &x : vec) x *= k;
}
template <typename T>
void operator-=(vector<T> &a, const vector<T> &b) {
  assert(a.size() == b.size());
  for (size_t it = 0; it < a.size(); it++) {
    a[it] -= b[it];
  }
}
template <typename T>
vector<T> operator*(const vector<T> &vec, int k) {
  vector<T> res(vec);
  res *= k;
  return res;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &cout, pair<T1, T2> p) {
  cout << "(" << p.first << ',' << p.second << ")";
  return cout;
}
template <typename T, typename T2>
ostream &operator<<(ostream &cout, set<T, T2> s) {
  vector<T> t;
  for (auto x : s) t.push_back(x);
  cout << t;
  return cout;
}
template <typename T, typename T2>
ostream &operator<<(ostream &cout, multiset<T, T2> s) {
  vector<T> t;
  for (auto x : s) t.push_back(x);
  cout << t;
  return cout;
}
template <typename T>
ostream &operator<<(ostream &cout, queue<T> q) {
  vector<T> t;
  while (q.size()) {
    t.push_back(q.front());
    q.pop();
  }
  cout << t;
  return cout;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &cout, map<T1, T2, T3> m) {
  for (auto &x : m) {
    cout << "Key: " << x.first << ' ' << "Value: " << x.second << endl;
  }
  return cout;
}
template <typename T>
T operator*(vector<T> v1, vector<T> v2) {
  assert(v1.size() == v2.size());
  int n = v1.size();
  T res = 0;
  for (int i = 0; i < n; i++) {
    res += v1[i] * v2[i];
  }
  return res;
}
template <typename T1, typename T2>
void operator+=(pair<T1, T2> &x, const pair<T1, T2> y) {
  x.first += y.first;
  x.second += y.second;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &x, const pair<T1, T2> &y) {
  return make_pair(x.first + y.first, x.second + y.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &x, const pair<T1, T2> &y) {
  return make_pair(x.first - y.first, x.second - y.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(pair<T1, T2> x) {
  return make_pair(-x.first, -x.second);
}
template <typename T>
vector<vector<T>> operator~(vector<vector<T>> vec) {
  vector<vector<T>> v;
  int n = vec.size(), m = vec[0].size();
  v.resize(m);
  for (int i = 0; i < m; i++) {
    v[i].resize(n);
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      v[i][j] = vec[j][i];
    }
  }
  return v;
}
void print0x(int x) {
  std::vector<int> vec;
  while (x) {
    vec.push_back(x & 1);
    x >>= 1;
  }
  std::reverse(vec.begin(), vec.end());
  for (int i = 0; i < (int)vec.size(); i++) {
    std::cout << vec[i];
  }
  std::cout << ' ';
}
template <typename T>
void print0x(T x, int len) {
  std::vector<int> vec;
  while (x) {
    vec.push_back(x & 1);
    x >>= 1;
  }
  reverse(vec.begin(), vec.end());
  for (int i = (int)vec.size(); i < len; i++) {
    putchar('0');
  }
  for (size_t i = 0; i < vec.size(); i++) {
    std::cout << vec[i];
  }
  std::cout << ' ';
}
using namespace std;
int n, m, k;
int a[100005];
struct Frac {
  long double a;
  long double b;
  Frac() {}
  Frac(long long x) {
    a = x;
    b = 1;
  }
  Frac(long long x, long long y) {
    a = x;
    b = y;
  }
  int id;
  bool operator<(const Frac &oth) const & { return a * oth.b < b * oth.a; }
};
ostream &operator<<(ostream &cout, const Frac &x) {
  cout << make_pair(x.a, x.b);
  return cout;
}
vector<int> rubbish;
vector<pair<int, int>> assigns[100005];
vector<pair<int, int>> adds[100005];
vector<pair<Frac, int>> operations;
int tp[100005];
vector<int> res;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
  }
  for (int i = 0; i < m; i++) {
    int type, x, b;
    scanf("%d%d%d", &type, &x, &b);
    tp[i] = type;
    x--;
    if (type == 1) {
      assigns[x].push_back(make_pair(b, i));
    }
    if (type == 2) {
      adds[x].push_back(make_pair(b, i));
    }
    if (type == 3) {
      operations.push_back(make_pair(Frac(b), i));
    }
  }
  for (int i = 0; i < n; i++) {
    sort(assigns[i].begin(), assigns[i].end());
    reverse(assigns[i].begin(), assigns[i].end());
    if (assigns[i].size() == 0) continue;
    if (assigns[i][0].first <= a[i]) continue;
    adds[i].push_back(
        make_pair(assigns[i][0].first - a[i], assigns[i][0].second));
  }
  for (int i = 0; i < n; i++) {
    sort(adds[i].begin(), adds[i].end());
    reverse(adds[i].begin(), adds[i].end());
    long long now = a[i];
    for (int it = 0; it < (int)adds[i].size(); it++) {
      operations.push_back(
          make_pair(Frac(now + adds[i][it].first, now), adds[i][it].second));
      now += adds[i][it].first;
    }
  }
  sort(operations.begin(), operations.end());
  reverse(operations.begin(), operations.end());
  for (int it = 0; it < min((int)operations.size(), k); it++) {
    if (operations[it].first < Frac(1)) break;
    res.push_back(operations[it].second);
  }
  cout << res.size() << endl;
  for (auto x : res) {
    if (tp[x] == 1) {
      printf("%d ", x + 1);
    }
  }
  for (auto x : res) {
    if (tp[x] == 2) {
      printf("%d ", x + 1);
    }
  }
  for (auto x : res) {
    if (tp[x] == 3) {
      printf("%d ", x + 1);
    }
  }
  puts("");
  return 0;
}
