#include<bits/stdc++.h>
#define ing long long
using namespace std;
int n,q;
int x,d;
const int N = 2e5+10;
int a[N];
int t[N];

int lowbit(int x) { return x & (-x); }

int find(int x) {
	int res = 0;
	while (x > 0) {
		res += t[x];
		x-=lowbit(x);
	}
	return res;
}

void add(int x, int k) {
	int tmp = k - a[x];
	a[x] = k;
	while (x <= n) {
		t[x] += tmp;
		x += lowbit(x);
	}
}

signed main(){
	cin >> n >> q;
	for(int i=1;i<=n;i++){
		cin >> a[i];
	}
	for(int i = 1;i <= n;i++)  t[i] = a[i];
	for(int i = 1; i <= n; i++)  if(i + lowbit(i) <= n)  t[i + lowbit(i)] += t[i];

	while(q--){
		int fl;
		cin>>fl;
		if(fl == 1){
			cin >> x >> d;
			add(x,d);
		}
		else if(fl == 2){
			cin >> x;
			cout << find(x) * 1ll << endl;
		}
	}
	return 0;
}