#include <cstdio>
#define NMAX 100001
using namespace std;

FILE*f=freopen("datorii.in","r",stdin);
FILE*g=freopen("datorii.out","w",stdout);
int n,m,oak[2 * NMAX],t,a,b;


inline void build()
{
  for (int i=n-1;i;--i)      oak[i] =oak[i<<1]+oak[(i<<1)|1];
}

inline void modify(int p, int value)
{ int tmp;
  p+=n-1;oak[p]-=value;

            while (p > 1) {
                tmp = p >> 1;
                oak[tmp]-=value;
                p = tmp;
            }
}

inline int query(int l, int r)
{
  int res = 0;
  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
    if (l&1) res += oak[l++];
    if (r&1) res += oak[--r];
  }
  return res;
}

int main() {
  scanf("%d %d", &n,&m);
  for (int i = 0; i < n; ++i) scanf("%d", oak+n+i);
  build();

  while(m--)
  { scanf("%d %d %d", &t,&a,&b);
    if(t==1) printf("%d\n",query(a-1,b+1));
    else modify(a-1,b);
  }


}