#include <fstream>
#define MAX 16000
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int tree[4*MAX];
int lazy[4*MAX];
int v[MAX];
int n,m;
void update(int node, int left, int right,int x,int y, int val);
int query(int node, int left, int right,int x,int y);
void build(int node,int left,int right);
int main()
{
    int i,ce,x,y;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    build(1,1,n);
    for(i=1;i<=m;i++)
    {
        fin>>ce>>x>>y;
        if(!ce)
            update(1,1,n,x,x,-y);
        else
            fout<<query(1,1,n,x,y)<<endl;
    }
    return 0;
}
void build(int node,int left,int right)
{
    if(left==right)
    {
        tree[node]=v[left];
        return;
    }
    int mid=(left+right)/2;
    build(2*node,left,mid);
    build(2*node+1,mid+1,right);
    tree[node]=tree[2*node]+tree[2*node+1];
}
void update(int node, int left, int right, int x, int y, int val){

    int mid = (left + right) / 2;
    if(lazy[node] && left != right){
       lazy[2 * node] += lazy[node] * (mid - left +1);
       lazy[2 * node + 1] += lazy[node] * (right - mid);
       tree[2 * node] += lazy[node];
       tree[2 * node + 1] += lazy[node];
       lazy[node] = 0;
    }
    if(x <= left && right <= y){
       lazy[node] += val;
       tree[node] += val * (right - left +1);
       return;
    }
    if(x <= mid)
       update(2 * node, left, mid, x, y, val);
    if(y > mid)
       update(2 * node + 1, mid + 1, right, x, y, val);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
}
int query(int node, int left, int right, int x, int y){
    int mid = (left + right) / 2;
    if(lazy[node] && left != right){
       lazy[2 * node] += lazy[node] * (mid - left +1);
       lazy[2 * node + 1] += lazy[node] * (right - mid);
       tree[2 * node] += lazy[node];
       tree[2 * node + 1] += lazy[node];
       lazy[node] = 0;
    }
    if(x <= left && right <= y)
       return tree[node];
    int ans1 = 0, ans2 = 0;
    if(x <= mid)
       ans1 = query(2 * node, left, mid, x, y);
    if(y > mid)
       ans2 = query(2 * node + 1, mid + 1, right, x, y);

    return ans1 + ans2;
}