#include<iostream>

 #include<cstdio>

 #include<cstring>

 using namespace std;

 int n,m;

 int tree[],a[];

 int lowbit(int x)

 {

     return x&-x;

 }

 void add(int k,int num)//给k位置的数值加num

 {

     while(k<=n)

     {

         tree[k]+=num;

         k+=lowbit(k);

     }

 }

 int sum(int k)//前缀和

 {

     int s=;

     while(k)

     {

         s+=tree[k];

         k-=lowbit(k);

     }

     return s;

 }

 int main()

 {

     scanf("%d%d",&n,&m);

     for(int i=;i<=n;i++)

     {

         scanf("%d",&a[i]);

         add(i,a[i]);

     }

     for(int i=;i<=m;i++)

     {

         int c;scanf("%d",&c);

         if(c == )

         {

             int x,k;

             scanf("%d%d",&x,&k);

             add(x,k);

         }

         else

         {

             int x,y;scanf("%d%d",&x,&y);

             printf("%d\n",sum(y)-sum(x-));

         }

     }

     return ;

 }