PROGRAMMING:A strong talker
In the S8 finals, Ig won the first championship of the League of heroes world finals for China. The vast number of summoners are jubilant and return to Summoner Canyon one after another. They choose Yasuo in seconds and send their heads off.
![ Open black, I play compression. JPG] (~ / a3f2058c-88b4-4d55-b6aa-844c61c52664. JPG? Width half)
In the valley of summoner, excellent summoners always like to compare their fighting power, and bronze summoners are not willing to be outdone. They compare the strength of muzzle guns. Because their mouth gun level is always changing, it is difficult to compare them manually, so please help them develop an algorithm to find out the one with strong mouth.
###Input format:
In the first line, two positive integers, $$n, M $$, indicate that there are $$n $$players, $$M $$times of operation ($$1 / Leq n / Leq 10 ^ 5, 1 / Leq M / Leq 5000 $$).
There are $$n $$integers in the second line, which respectively represent the initial muzzle shot value $$a of the $$I $$player_ i$$； Player numbers range from $$1 $$to $$n $$.
Next, there are $$M $$lines, each with three positive integers $$X, l, R $$;
When $$x = 1 $$, this is a query operation. In the query interval, $[l, R] $, the summoner with the highest muzzle gun value, that is, the one with strong muzzle;
When $$x = 0 $$, this is an update operation, which means that the shot value of player $$l $$is updated to $$R $.
The question guarantees that in each query interval, the strong talker is unique.
###Output format:
For each query operation, output the number and shot value of the strong mouth king in a line, separated by spaces, and there is no extra space at the end of the line.
###Input example:
```in
5 6
1 2 3 4 5
1 1 5
0 3 6
1 3 4
1 4 5
0 2 9
1 1 5
```
###Output example:
The corresponding output is given here. For example:
```out
5 5
3 6
5 5
2 9
```
answer：If there is no answer, please comment
![ Open black, I play compression. JPG] (~ / a3f2058c-88b4-4d55-b6aa-844c61c52664. JPG? Width half)
In the valley of summoner, excellent summoners always like to compare their fighting power, and bronze summoners are not willing to be outdone. They compare the strength of muzzle guns. Because their mouth gun level is always changing, it is difficult to compare them manually, so please help them develop an algorithm to find out the one with strong mouth.
###Input format:
In the first line, two positive integers, $$n, M $$, indicate that there are $$n $$players, $$M $$times of operation ($$1 / Leq n / Leq 10 ^ 5, 1 / Leq M / Leq 5000 $$).
There are $$n $$integers in the second line, which respectively represent the initial muzzle shot value $$a of the $$I $$player_ i$$； Player numbers range from $$1 $$to $$n $$.
Next, there are $$M $$lines, each with three positive integers $$X, l, R $$;
When $$x = 1 $$, this is a query operation. In the query interval, $[l, R] $, the summoner with the highest muzzle gun value, that is, the one with strong muzzle;
When $$x = 0 $$, this is an update operation, which means that the shot value of player $$l $$is updated to $$R $.
The question guarantees that in each query interval, the strong talker is unique.
###Output format:
For each query operation, output the number and shot value of the strong mouth king in a line, separated by spaces, and there is no extra space at the end of the line.
###Input example:
```in
5 6
1 2 3 4 5
1 1 5
0 3 6
1 3 4
1 4 5
0 2 9
1 1 5
```
###Output example:
The corresponding output is given here. For example:
```out
5 5
3 6
5 5
2 9
```
answer：If there is no answer, please comment