A sequence $A_1, A_2, \ldots, A_N$ of length $N$ is given. Write a program to process the following queries:

• 1 i v: Set $A_i$ to $v$.
• 2 k i j: When the $k$-th type-1 query has been applied, output the sum of $A_i, A_{i+1}, \ldots, A_j$.

Input

The first line contains the length $N$ of the sequence ($1 \le N \le 100{,}000$).

The second line contains $A_1, A_2, \ldots, A_N$ ($1 \le A_i \le 1{,}000{,}000$).

The third line contains the number of queries $M$ ($1 \le M \le 100{,}000$).

The next $M$ lines each contain a query. For type-1 queries, $1 \le i \le N$, $1 \le v \le 1{,}000{,}000$; for type-2 queries, $1 \le i \le j \le N$, and $0 \le k \le$ (the number of type-1 queries given up to that point).

All numbers in the input are integers.

Output

For each type-2 query, output its sum.

Examples

Input 1

5
1 2 3 4 5
7
1 2 5
2 0 1 3
2 1 1 3
1 4 2
2 0 2 5
2 1 2 5
2 2 2 5

Output 1

6
9
14
17
15