#include <fstream>

using namespace std;
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int n,m,i,v[15001],aib[15001],a,b,c;
void update (int poz,int val)
{
    for (int i=poz;i<=n;i+=i&(-i))
    {
        aib[i]+=val;
    }
}
int querry (int poz1, int poz2)
{
    int s1=0,s2=0;
    for (int i=poz1-1;i>=1;i-=i&(-i))
    {
        s1+=aib[i];
    }
    for (int i=poz2;i>=1;i-=i&(-i))
    {
        s2+=aib[i];
    }
    return s2-s1;
}
int main()
{
    fin>>n>>m;
    for (i=1;i<=n;i++)
    {
        fin>>v[i];
        update(i,v[i]);
    }
    for (i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        if (a==1)
        {
            fout<<querry(b,c)<<'\n';
        }
        else
        {
            update(b,-c);
        }
    }

    return 0;
}