#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,t[2 * NMAX],q,a,b;

void build() {
  for (int i = n - 1; i > 0; --i) t[i] = t[i<<1] + t[i<<1|1];
}

void modify(int p, int value) {
  p--;
  for (t[p += n] -= value; p > 1; p >>= 1) t[p>>1] -=value;
}

int query(int l, int r)
{
  int res = 0;l--;

  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
    if (l&1) res += t[l++];
    if (r&1) res += t[--r];
  }
  return res;
}

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

 while(m--)
 {   scanf("%d %d %d", &q,&a,&b);

    if(q==1) printf("%d\n", query(a, b));
    else modify(a,b);
 }


}