Problem: Vasya plays one very well-known and extremely popular MMORPG game. His game character has k skill; currently the i-th of them equals to ai. Also this game has a common rating table in which the participants are ranked according to the product of all the skills of a hero in the descending order.

Vasya decided to 'upgrade' his character via the game store. This store offers n possible ways to improve the hero's skills; Each of these ways belongs to one of three types:

  1. assign the i-th skill to b; 
  2. add b to the i-th skill; 
  3. multiply the i-th skill by b. 



Unfortunately, a) every improvement can only be used once; b) the money on Vasya's card is enough only to purchase not more than m of the n improvements. Help Vasya to reach the highest ranking in the game. To do this tell Vasya which of improvements he has to purchase and in what order he should use them to make his rating become as high as possible. If there are several ways to achieve it, print any of them.

Input

The first line contains three numbers — k, n, m (1 ≤ k ≤ 105, 0 ≤ m ≤ n ≤ 105) — the number of skills, the number of improvements on sale and the number of them Vasya can afford.

The second line contains k space-separated numbers ai (1 ≤ ai ≤ 106), the initial values of skills.

Next n lines contain 3 space-separated numbers tj, ij, bj (1 ≤ tj ≤ 3, 1 ≤ ij ≤ k, 1 ≤ bj ≤ 106) — the type of the j-th improvement (1 for assigning, 2 for adding, 3 for multiplying), the skill to which it can be applied and the value of b for this improvement.

Output

The first line should contain a number l (0 ≤ l ≤ m) — the number of improvements you should use.

The second line should contain l distinct space-separated numbers vi (1 ≤ vi ≤ n) — the indices of improvements in the order in which they should be applied. The improvements are numbered starting from 1, in the order in which they appear in the input. 

Examples

Input

2 4 3
13 20
1 1 14
1 2 30
2 1 6
3 2 2


Output

3
2 3 4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long w[100010];
struct node {
  long long first, second;
  int i, id, type;
  bool operator<(const node& a) const {
    return first * a.second < second * a.first;
  }
};
int a[100010], b[100010];
vector<pair<int, int> > B;
vector<pair<int, pair<int, int> > > A[100010];
int main() {
  int n, m, i, j, k;
  scanf("%d%d%d", &k, &n, &m);
  for (i = 0; i < k; i++) scanf("%I64d", &w[i]);
  for (i = 0; i < n; i++) {
    int t, first, second;
    scanf("%d%d%d", &t, &first, &second);
    first--;
    if (t == 1) {
      if (second > w[first] && a[first] < second)
        a[first] = second, b[first] = i;
    } else if (t == 2) {
      A[first].push_back(make_pair(second, make_pair(i, 1)));
    } else
      B.push_back(make_pair(second, i));
  }
  sort(B.begin(), B.end());
  for (i = 0; i < k; i++) {
    if (a[i]) A[i].push_back(make_pair(a[i] - w[i], make_pair(b[i], 0)));
  }
  priority_queue<node> q;
  for (i = 0; i < k; i++) {
    a[i] = 0;
    if (A[i].size()) {
      sort(A[i].rbegin(), A[i].rend());
      q.push((node){A[i][0].first, w[i], i, A[i][0].second.first,
                    A[i][0].second.second});
    }
  }
  vector<pair<int, int> > ans;
  for (i = 0; i < m; i++) {
    if (B.empty() && q.empty()) break;
    if (q.empty()) {
      j = B.size() - 1;
      ans.push_back(make_pair(2, B[j].second));
      B.pop_back();
      continue;
    }
    if (!B.empty()) {
      j = B.size() - 1;
      node e = q.top();
      if ((B[j].first - 1) * e.second >= e.first) {
        ans.push_back(make_pair(2, B[j].second));
        B.pop_back();
        continue;
      }
    }
    node e = q.top();
    q.pop();
    ans.push_back(make_pair(e.type, e.id));
    w[e.i] += e.first;
    a[e.i]++;
    if (a[e.i] < A[e.i].size()) {
      q.push((node){A[e.i][a[e.i]].first, w[e.i], e.i,
                    A[e.i][a[e.i]].second.first, A[e.i][a[e.i]].second.second});
    }
  }
  sort(ans.begin(), ans.end());
  printf("%d\n", ans.size());
  for (i = 0; i < ans.size(); i++) printf("%d ", ans[i].second + 1);
  puts("");
}