#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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


int Aib[15003];
int N, M;

void Update(int x, int val)
{
    for (int i = x; i <= N; i += i & -i)
        Aib[i] += val;
}
int Query(int x)
{
    int ans = 0;
    for (int i = x; i > 0; i -= i & -i)
        ans += Aib[i];
    return ans;
}
int main()
{
    f >> N >> M;
    for (int i = 1; i <= N; ++i)
    {
        int x;
        f >> x;
        Update(i, x);
    }
    for (int i = 1; i <= M; ++i)
    {
        int type, val, poz;
        f >> type >> poz >> val;
        if (type == 0)
            Update(poz, -val);
        else
            g << Query(val) - Query(poz - 1) << "\n";
    }
    f.close();
    g.close();
    return 0;
}