#include <bits/stdc++.h>

#define LBS(x) ( (x) & (-x) )
using namespace std;

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

vector<int>debts;
int n, m;

void update(int pos, int val)
{
    for (; pos <= n; pos += LBS(pos))
        debts[pos] += val;
}

int query(int pos)
{
    int sum = 0;
    for(; pos; pos -= LBS(pos))
        sum += debts[pos];
    return sum;
}

int main()
{
    fin >> n >> m;

    debts.resize(n + 1);
    for(int i = 1, x; i <= n; ++i)
        fin >> x, update(i, x);

    for (int step = 1, i, j, k ; step <= m; ++step)
    {
        fin >> i >> j >> k;
        if (i == 1)
            fout << query(k) - query(j - 1) << "\n";
        else // case 2
            update(j, -k);
    }

    return 0;
}