#include <fstream>
#include<vector>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
vector<int> s3(60005);
void update(int node, int from, int to, int pos, int val) {
    if (from == to) {
        s3[node] += val;
        return;
    }

    int mid = (from + to) / 2;
    if (pos <= mid) {
        update(node * 2, from, mid, pos, val);
    }
    else {
        update(node * 2+1, mid+1, to, pos, val);
    }

    s3[node] = s3[node * 2] + s3[node * 2 + 1];
}
int query(int node, int from, int to, int ql, int qr) {
    if (ql <= from && to <= qr)
        return s3[node];

    int mid = (from + to) / 2;
    int sum = 0;

    if (mid >= ql) {
        sum += query(node * 2, from, mid, ql, qr);
    }
    if (mid+1 <= qr) {
        sum += query(node * 2 + 1, mid + 1, to, ql, qr);
    }
    return sum;
}
int main()
{
    int n,i,m,a,b,c;
    cin>>n>>m;
    for (i = 1; i <= n; i++) 
    {
        cin >> a;
        update(1, 1, n, i, a);
    }
    for (i = 0; i < m; i++) 
    {
        cin>>a>>b>>c;
        if (a == 0) 
        {
            update(1, 1, n, b, -c);
        }
        else 
        {
            cout << query(1, 1, n, b, c) << "\n";
        }
    }
    return 0;
}