#include <bits/stdc++.h>

using namespace std;

ifstream fin("datorii.in");
ofstream fout("datorii.out");

const int MAXN = 15005;
int aint[4 * MAXN];

// Funcția pentru actualizarea sumei
void update(int node, int left, int right, int poz, int value) {
    if (left == right) {
        aint[node] += value; // Adaugă diferența la valoarea curentă
        return;
    }
    int mid = (left+right)/2;
    if (poz <= mid) {
        update(node*2,left,mid,poz,value);
    } else {
        update(node*2+1,mid+1,right,poz,value);
    }
    aint[node] = aint[node*2] + aint[node*2+1];
}

int query(int node, int left, int right, int a, int b) {
    if (a <= left && right <= b) {
        return aint[node];
    }
    int mid = (left + right) / 2;
    int leftSum = 0, rightSum = 0;
    if (a <= mid) {
        leftSum = query(node * 2, left, mid, a, b);
    }
    if (mid + 1 <= b) {
        rightSum = query(node * 2 + 1, mid + 1, right, a, b);
    }
    return leftSum + rightSum;
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i=1;i<=n;++i) {
        int x;
        fin >> x;
        update(1,1,n,i,x);
    }
    for (int i=1;i<=m;++i) {
        int C,x,y;
        fin >> C >> x >> y;
        if (C==1) {
            fout << query(1,1,n,x,y) << '\n';
        }else{
            update(1,1,n,x,-y);
        }
    }
    return 0;
}