In the Pradnya Planet, there are n aliens which have different powers.
The aliens are numbered from A₁ to A_n, and their respective powers are denoted
from P₁ to P_n. Now, these aliens have to fight against another planet for d days.
For each day, either of these 2 situations can occur:
1. If situation is 'C'
Any two aliens from range A_l to A_r will have to fight against another planet
(The resultant power of the 2 aliens fighting will be the product of their individual powers)

2. If situation is 'P'
An alien A_i changes its power to p

Now, Yash Lahoti being the "Big Boss" of these n aliens, needs to make sure that the
2 aliens going on any day produce the maximum power. Help Rushabh determine the maximum
power which can be produced each day.


Input Format:
First line contains two space separated integers n and d, denoting the number of aliens and number of days.
Each of the next n lines contains the power of the n respective aliens

Each of the next d lines can contain 3 space separated inputs of two types:
Type 1: 'C'     l     r
where 'C' represents the situation,
l and r represents the range of aliens A_l to A_r, out of which any two can go to fight.

Type 2: 'P'     i     p
where 'P' represents the situaton,
i and p represent that the power of alien A_i becomes p


Output Format:
For each of the situation of type 'P', output a single line one integer deonting the maximum power which
can be produced by any of the 2 aliens from range (A_l to A_r).


Constraints:
2 <= n <= 10⁵
-4*10⁴ <= P₁, P₂ ,...P_n <= 4*10⁴
1 <= d <= 10⁶
1 <= l < r <=n
1 <= i <= n
-4*10⁴ <= p <= 4*10⁴