#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define ll long long
#define ull unsigned long long
#define x first
#define y second
#define pi pair<int,int>
#define pl pair<ll,ll>
#define EPSILON 0.000001

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");

const ll NMAX=1e5+5,INF=1e18,MOD=104659,MMAX=1e2+5,inf=INT_MAX;

int N,M;
int v[NMAX],aint[NMAX];

void update(int nod,int left,int right,int pos,int val)
{
    if(left==right)
    {
        aint[nod]+=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)update(2*nod,left,mid,pos,val);
    else update(2*nod+1,mid+1,right,pos,val);
    aint[nod]=aint[2*nod]+aint[2*nod+1];
}

int querry(int nod,int left,int right,int st,int dr)
{
    if(left==st&&right==dr)
    {
        return aint[nod];
    }
    int mid=(left+right)/2;
    if(dr<=mid)querry(2*nod,left,mid,st,dr);
    else if(st>mid)querry(2*nod+1,mid+1,right,st,dr);
    else return querry(2*nod,left,mid,st,mid)+querry(2*nod+1,mid+1,right,mid+1,dr);
}

int main()
{
    fin>>N>>M;
    for(int i=1;i<=N;i++)
    {
        fin>>v[i];
        update(1,1,N,i,v[i]);
    }
    for(int i=1;i<=M;i++)
    {
        int task,a,b;
        fin>>task>>a>>b;
        if(task==0)update(1,1,N,a,-b);
        else fout<<querry(1,1,N,a,b)<<'\n';
    }

    return 0;
}