#include <bits/stdc++.h>
#define MAX 1000010
#define ll long long
using namespace std;
ifstream f ("datorii.in");
ofstream g ("datorii.out") ;
bool prim[MAX];
ll a[MAX],N ,  A , B , t = 0 , v[2000] , nr , prod , S = 0 , m = 0 , j ,n,i,x,y,z;
void updatenstrass (int i, int x)
{
    int j;
    for(j=i;j<=n;j+=(j&(-j)))
    v[j]+=x;
    return;
    }
    int qwerryonmadick (int i)
    {int j,s=0;
        for (j=i;j>0;j-=(j&(-j)))
        s+=v[j];
            return s;
    }


int main()
{f>>n>>m;
for(i=1;i<=n;i++)
{int d;
    f>>d;
    updatenstrass(i,d);
}
for(i=1;i<=m;i++)
{
    f>>x>>y>>z;
    if(x==0) {updatenstrass(y,-z);}
        else {


            g<<qwerryonmadick(z)-qwerryonmadick(y-1)<<endl;

        }
}
    return 0 ;
}