Codeforces Round 295 (Div. 1)
D
Shop
Codeforces
2800
原题
← CE →
翻译中…

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 $*a*_{*i*}$. 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* ≤ 10^{5}$, $0 ≤ *m* ≤ *n* ≤ 10^{5}$) — 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 $*a*_{*i*}$ ($1 ≤ *a*_{*i*} ≤ 10^{6}$), the initial values of skills.

翻译中…

Next $*n*$ lines contain $3$ space-separated numbers $*t*_{*j*}, *i*_{*j*}, *b*_{*j*}$ ($1 ≤ *t*_{*j*} ≤ 3, 1 ≤ *i*_{*j*} ≤ *k*, 1 ≤ *b*_{*j*} ≤ 10^{6}$) — 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 $*v*_{*i*}$ ($1 ≤ *v*_{*i*} ≤ *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.

翻译中…

样例

Input #1
2 4 3
13 20
1 1 14
1 2 30
2 1 6
3 2 2
Output #1
3
2 3 4
InputCopy OutputCopy
题目信息
题号
521D
时间限制
2 s
内存限制
256 MB
标签
贪心

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。