CF1211A.Three Problems

Polycarp is choosing three problems for creating a programming test. Totally he has $n$ problems in his list. The complexity of the $i$-th problem equals $r_i$. All problems are numerated from $1$ to $n$.

Help Polycarp to choose such three problems $a$, $b$ and $c$, so that the complexity of the first problem strictly less than the complexity of second problem and the complexity of the second problem is strictly less than the complexity of the third problem. So, for chosen problems $a$, $b$ and $c$ it should be true that $r_a \lt r_b \lt r_c$.

If Polycarp can choose three problems in different ways, you can print any of them.

Polycarp 正在为编程测试挑选三道题目。他总共有 $n$ 道题目，列于清单中。第 $i$ 道题目的难度为 $r_i$。所有题目编号从 $1$ 到 $n$。

请帮助 Polycarp 选出三道题目 $a$、$b$ 和 $c$，使得第一道题的难度严格小于第二道题的难度，且第二道题的难度严格小于第三道题的难度。即，对所选题目 $a$、$b$、$c$，需满足 $r_a \lt r_b \lt r_c$。

若 Polycarp 存在多种选法，输出任意一种即可。

The first line of the input contains one integer $n$ ($3 \le n \le 3000$) — the number of problems in Polycarp's list.

The second line of the input contains $n$ integers $r_1, r_2, \dots, r_n$ ($1 \le r_i \le 10^9$), where $r_i$ is the complexity of the $i$-th problem.

输入的第一行包含一个整数 $n$（$3 \le n \le 3000$）—— 表示 Polycarp 列表中问题的数量。

输入的第二行包含 $n$ 个整数 $r_1, r_2, \dots, r_n$（$1 \le r_i \le 10^9$），其中 $r_i$ 表示第 $i$ 个问题的难度。

If Polycarp has no ways to choose three problems, you should print three numbers -1. Ih there is a way to choose them, you should print three different integers $a, b, c$ ($1 \le a, b, c \le n$), where $a$ is the number of the first chosen problem, $b$ is the number of the second chosen problem and $c$ is the number of the third chosen problem.

如果波利卡普无法选出三个题目，则应输出三个数字 $-1$。如果存在一种选法，则应输出三个互不相同的整数 $a, b, c$（$1 \le a, b, c \le n$），其中 $a$ 是第一个所选题目的编号，$b$ 是第二个所选题目的编号，$c$ 是第三个所选题目的编号。