#include <cstdio>
#include <algorithm>
#include <cctype>

#define NMAX 15002

using namespace std;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};


int N, M, A[NMAX], T[4*NMAX];
int val, pos, S, E;

void build(int node, int st, int dr) {
    if(st == dr) {
        T[node] = A[st];
    } else {
        int mid = (st + dr) / 2;
        build(2 * node, st, mid);
        build(2 * node + 1, mid + 1, dr);
        T[node] = T[2 * node] + T[2 * node + 1];
    }
}

void update(int node, int st, int dr) {
    if(st == dr) {
        T[node] -= val;
    } else {
        int mid = (st + dr) / 2;
        if(pos <= mid) {
            update(2 * node, st, mid);
        } else {
            update(2 * node + 1, mid + 1, dr);
        }
        T[node] -= val;
    }

}

void query(int node, int st, int dr) {
    if(S <= st && dr <= E) {
        val += T[node];
    } else {
        int mid = (st + dr) / 2;
        if(S <= mid) {
            query(2*node, st, mid);
        }
        if(E > mid) {
            query(2*node + 1, mid + 1, dr);
        }
    }
}

int main() {
    InParser fin("datorii.in");
    FILE *out = fopen("datorii.out", "w");

    fin >> N >> M;
    for(int i = 1; i <= N; i++) {
        fin >> A[i];
    }

    build(1, 1, N);

    for(int i = 1; i <= M; i++) {
        int cerinta;
        fin >> cerinta;
        if(!cerinta) {
            fin >> pos >> val;
            update(1, 1, N);
        } else {
            fin >> S >> E;
            val = 0;
            query(1, 1, N);
            fprintf(out, "%d\n", val);
        }
    }

}