//#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <tuple>
#include <fstream>
#include <iomanip>
#include <utility>

#pragma warning "da 100% din tine. :)"
#define nl '\n'
#define sp ' '
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SIZE 3000
#define NR 105
#define N 11
#define INF 10000

using namespace std;
//CITESTE FENWICK TREE DE PE WIKIPEDIAAAAAAAA
int copacel[15005];

int n, m;

int sum(int i) // Returns the sum from index 1 to i
{
    int sum = 0;
    while (i)
        sum += copacel[i], i -= (i & -i);
    return sum;
}

void add(int i, int k) // Adds k to element with index i
{
    while (i <= n)
        copacel[i] += k, i += (i & -i);
}

ifstream cin("datorii.in");
ofstream cout("datorii.out");
int main() {
//    freopen("datorii.in", "r", stdin);
//    freopen("datorii.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    clock_t tStart = clock();
    int k;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> k;
        add(i,k);
    }
    int task,a,b;
    while(m--){
        cin >> task >> a >> b;
        if(task==0){
            add(a,-b);
        }
        else{
            cout << sum(b)-sum(a-1) << nl;
        }
    }
//    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}