6073: Sereja and Array

内存限制:256 MB 时间限制:2 S 标准输入输出
题目类型:传统 评测方式:文本比较 上传者:
提交:1 通过:1

题目描述

B. Sereja and Array
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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:
  1. Make vi-th array element equal to xi. In other words, perform the assignment avi=xi.
  2. Increase each array element by yi. In other words, perform n assignments ai=ai+yi (1≤in).
  3. 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
The first line contains integers n, m (1≤n,m≤105). The second line contains n space-separated integers a1,a2,...,an (1≤ai≤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≤ti≤3) that represents the operation type. If ti=1, then it is followed by two integers vi and xi, (1≤vin,1≤xi≤109). If ti=2, then it is followed by integer yi (1≤yi≤104). And if ti=3, then it is followed by integer qi (1≤qin).
Output
For each third type operation print value aqi. Print the values in the order, in which the corresponding queries follow in the input.
Examples
Input
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
Output
2
9
11
20
30
40
39

输入样例 复制


输出样例 复制