Problem Statement

An array consisting of 0's,1's and 2's is given.2 operations can be performed in arrays.
Q a b->it should return number of 0's,1's and 2's in range a to b(including both a & b).
U a v->it updates value at index a to value v.(v will be either 0,1 or 2)
All indexes are 0 based indexes.

Input

First line of input contains N(number of elements in the array)
Second line contain elements in the array.
Third line contains number of operations to be performed(="P").
Each of the next P line contains any one of the two given operations.
Input is terminated by EOF.

Output

For each operation of type "Q a b",output three space seperated integers specifying number of 0's,1's and 2's respectively.

Constraints

N<=100000
P<=100000
0<=a<=b<N

Sample Input

``` 5 1 0 2 0 1 4 Q 0 4 U 1 2 U 4 0 Q 1 4 ```

Sample Output

``` 2 2 1 2 0 2 ```

Problem Setter:Abhishek Sanghai

Languages: C,C++,Java

Time Limit: 6 Second(s)
Score: 100 Point(s)
Input File Limit: 50000 Bytes

Mode Judge

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0