#include <fstream>
#define MAX 16000
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int tree[4*MAX];
int v[MAX];
int n,m;
int query(int node,int left,int right,int x,int y);
void update(int node, int left, int right, int pos, int val);
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,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 pos, int val){
    if(left==right)
    {
        tree[node]-=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)
        update(2*node,left,mid,pos,val);
    else
        update(2*node+1,mid+1,right,pos,val);
    tree[node]=tree[2*node]+tree[2*node+1];
}
int query(int node,int left,int right,int x,int y)
{
    int ans_l=0,ans_r=0;
    if(x<=left&&right<=y)
    {
        return tree[node];
    }
    int mid=(left+right)/2;
    if(x<=mid)
        ans_l=query(2*node,left,mid,x,y);
    if(y>mid)
        ans_r=query(2*node+1,mid+1,right,x,y);
    return ans_l+ans_r;
}