## HRSIAM - Angry Siam

You have an array of problems A with N problems. Each problem has a Difficulty level. i-th has dificulty A[i].

You want to give this problems to HrSiam. But you know, HrSiam doesn't like easy problems, so he will get angry. Also he doesn't want to solve problems with same difficulty again and again.

So he also has an array Angry, with N elements.

When he visits a problem with certain difficulty d, his angriness will increase by d * angry[1].
After some time if he again visits a problem with same difficulty, for the second time, then his angriness will increase by d * angry[2], and so on.
Basically, if he visit a problem with certain difficulty d for the i-th time, his angrines will increase by d * angry[i].

In this circumstances, you want to do 2 things -
1. You are afrad that HrSiam may get too angry, so you want to present a part of the array to him. But you need to quickly determine what will be his total angriness if you present the sub array of problems A[l...r] to HrSiam?
2. After certain time you may want to change difficulty of a problem, i.e set difficulty of x-th problem to y.

### Input

First line there will an integer N, the number of problems you have.

Next line will contain the difficulty of the problems, the array A[].

Next line will contain the array angry[], of length N.

Next line, there will be an integer Q, the number of queries you want to make.

Next Q lines will describe the queries, in format -

t x y

If t is one, then you need to find the total angriness of the Subarray A[l...r] when presented to HrSiam.
Else you need to set A[x] = y.

### Constrains

1 <= N, Q, x, y, A[i], angry[i] <= 100000

If x, y is in query of first type, then 1 <= x <= y <= N

### Output

For each query of first type, print an integer, the total angriness of the subarray. Solutions to the queries should be printed in the order they appeared in the input.

### Explanation of Sample

In the first sample, the first query range is [3, 6], the array elements are {3, 3, 1, 1}.
When HrSiam see the first problem with difficulty 3, his angriness will increase by 3 * angry[1].
Then he visit a problem with same difficulty he saw before, for the second time, so add 3 * angry[2]
Then 1 * angry[1] and 1 * angry[2]
Total = (3 * 1) + (3 * 2) + (1 * 1) + (1 * 2) = 12

### Example

```Input:
81 2 3 3 1 1 2 3 1 2 3 4 5 6 7 821 3 6 1 1 5 Output:
1214 ```

hide comments
 rezwanarefin: 2017-09-22 00:05:02 @[Rampage] Blue.Mary: Edited :) Thanks :) [Rampage] Blue.Mary: 2017-09-21 11:01:18 Are all the input numbers positive integers? Edit: Seems the answer is yes, but it should be clearly specified in input. Last edit: 2017-09-21 11:23:32

 Added by: Rezwan Date: 2017-09-21 Time limit: 2s Source limit: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All