#include <bits/stdc++.h>
#define INF 2140000000
#define MaxT 132000
#define MaxN 50005
#define MAX 131072

using namespace std;
const int NMAX = 100010;

FILE *IN, *OUT;

int N, M, ans;
int tip, Nr1, Nr2;
int tree[3 * NMAX], v[NMAX];

int pos, out, sign;
char f[MAX], Out[MAX], str[10], c;

inline void Write_Ch(char ch){
    Out[out++] = ch;
    if(out == MAX)
        fwrite(Out, MAX, 1, OUT), out = 0;
}

inline void Write_Int(int nr){
    int x = 0;
    if(nr < 0) Write_Ch('-'), nr =- nr;
    do{
        str[x++] = nr % 10 + '0';
        nr /= 10;
    }
    while(nr);
    while(x > 0)
        Write_Ch(str[--x]);
}

inline void Read(int &nr){
    sign = 0;
    nr = 0;
    while(f[pos] < '0' || f[pos] > '9'){
        if(f[pos] == '-') sign=1;
        pos++;
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    while(f[pos] >= '0' && f[pos] <= '9'){
        nr = 10 * nr + f[pos++] - '0';
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    if(sign) nr =- nr;
}

void read(){
    Read(N); Read(M);
    for(int i = 1; i <= N; i++){
        Read(v[i]);
        //Write_Int(v[i]); Write_Ch(' ');
    }
}

void Query(int node, int st, int nd, int A, int B){
    if(A <= st && nd <= B){
        ans += tree[node];
    } else {
        int mid = (st + nd) / 2;
        if(mid + 1 <= B) Query(2 * node + 1, mid + 1, nd, A, B);
        if(A <= mid) Query(2 * node, st, mid, A, B);
    }
}

int Update(int node, int st, int nd, int pos, int val){
    if(st == nd)
        tree[node] -= val;
    else {
        int mid = (st + nd) / 2;
        if(pos <= mid) Update(2 * node, st, mid, pos, val);
        else Update(2 * node + 1, mid + 1, nd, pos, val);
        tree[node] = tree[2 * node] + tree[2 * node + 1];
    }
}

int Build(int node, int st, int nd){
    if(st == nd)
        tree[node] = v[st];
    else {
        int mid = (st + nd) / 2;
        Build(2 * node, st, mid);
        Build(2 * node + 1, mid + 1, nd);
        tree[node] = tree[2 * node] + tree[2 * node + 1];
    }
}

int main(){

    IN = fopen("datorii.in", "r");
    OUT = fopen("datorii.out", "w");

    read();
    Build(1, 1, N);

    for(int i = 1; i <= M; i++){
        Read(tip); Read(Nr1); Read(Nr2);
        if(tip == 0){
            Update(1, 1, N, Nr1, Nr2);
        } else {
            ans = 0;
            Query(1, 1, N, Nr1, Nr2);
            Write_Int(ans);
            Write_Ch('\n');
        }
    }


    if(out > 0) fwrite(Out, 1, out, OUT);

    return 0;
}