#include <fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
int aint[400005];
void set(int node, int left, int right, int pos, int val)
{
    if(left == right)
    {
        aint[node] = val;
        return;
    }
    int mid = (left + right) / 2;
    if(pos <= mid)
    {
        set(node * 2, left, mid, pos, val);
    }
    else
    {
        set(node * 2 + 1, mid + 1, right, pos, val);
    }
    aint[node] = aint[node * 2] + aint[node * 2 + 1];
}
void update(int node, int left, int right, int pos, int val)
{
    if(left == right)
    {
        aint[node] -= val;
        return;
    }
    int mid = (left + right) / 2;
    if(pos <= mid)
    {
        update(node * 2, left, mid, pos, val);
    }
    else
    {
        update(node * 2 + 1, mid + 1, right, pos, val);
    }
    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 mij = (left + right) / 2;
    int lM = 0, rM = 0;
    if(a <= mij)
    {
        lM = query(2 * node, left, mij, a, b);
    }
    if(mij + 1 <= b)
    {
        rM = query(2 * node + 1, mij + 1, right, a, b);
    }
    return lM + rM;
}
int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        int x; cin >> x;
        set(1, 1, n, i, x);
    }
    for(int i = 0; i < m; i++)
    {
        int c, a, b;
        cin >> c >> a >> b;
        if(c == 1)
        {
            cout << query(1, 1, n, a, b) << "\n";
        }
        else
        {
            update(1, 1, n, a, b);
        }
    }
}