#include <bits/stdc++.h>
using namespace std;

ifstream f("datorii.in");
ofstream g("datorii.out");

const int N = 15001;
int n, m, arb[4 * N];

void BuildArbore(int node, int left, int right, int index, int val) //
{
    if(left == right)
    {
        arb[node] += val;
        return;
    }
    int mid = (left + right) / 2;

    if(index <= mid)
        BuildArbore(node * 2 , left, mid, index, val);
    else
        BuildArbore(node * 2 + 1, mid + 1, right, index, val);

    arb[node] = arb[node * 2] + arb[node * 2 + 1];
}

int Query(int node, int st, int dr, int l, int r)
{
    if(l <= st && dr <= r)
        return arb[node];

    int mij = (st + dr) / 2, Q1 = 0, Q2 = 0;

    if(l <= mij)
         Q1 = Query(node * 2, st, mij, l, r);
    if(r > mij)
         Q2 = Query(node * 2 + 1, mij + 1, dr, l, r);

    return Q1 + Q2;
}


int main()
{
    int i, x, a, b, op;
    f >> n >> m;
    for(i = 0; i < n; i++)
    {
        f >> x;
        BuildArbore(1, 0, n - 1, i, -x);
    }
    for(i = 0; i < m; i++)
    {
        f >> op >> a >> b;
        if(op == 0)
            BuildArbore(1, 0, n - 1, a - 1, b);
        else if (op == 1)
            g << -Query(1, 0, n - 1, a - 1, b - 1) << '\n';

    }

    return 0;
}