3580.Sereja and Array

Time Limit: 1s Memory Limit: 256MB

Sereja has got an array, consisting of n integers, a1,a2,...,an. Sereja is an active boy, so he is now going to complete m operations. Each operation will have one of the three forms:
Make vi-th array element equal to xi. In other words, perform the assignment avi=xi. Increase each array element by yi. In other words, perform n assignments ai=ai+yi (1 \le i \le n). Take a piece of paper and write out the qi-th array element. That is, the element aqi.
Help Sereja, complete all his operations.

Input Format(From the terminal/stdin)

The first line contains integers n, m (1 \le n,m \le 105). The second line contains n space-separated integers a1,a2,...,an (1 \le ai \le 109) - the original array.

Next m lines describe operations, the i-th line describes the i-th operation. The first number in the i-th line is integer ti (1 \le ti \le 3) that represents the operation type. If ti=1, then it is followed by two integers vi and xi, (1 \le vi \le n,1 \le xi \le 109). If ti=2, then it is followed by integer yi (1 \le yi \le 104). And if ti=3, then it is followed by integer qi (1 \le qi \le n).

Output Format(To the terminal/stdout)

For each third type operation print value aqi. Print the values in the order, in which the corresponding queries follow in the input.

Sample Input

Copy
10 11
1 2 3 4 5 6 7 8 9 10
3 2
3 9
2 10
3 1
3 10
1 1 10
2 10
2 10
3 1
3 10
3 9
  ·  \n
 · · · · · · · · ·  \n
 · \n
 · \n
 ·  \n
 · \n
 ·  \n
 · ·  \n
 ·  \n
 ·  \n
 · \n
 ·  \n
 · \n

Sample Output

Copy
2
9
11
20
30
40
39
 \n
 \n
  \n
  \n
  \n
  \n
  \n

Submit

请先 登录

© 2025 FAQs