// datorii -arbori pe intervale
#include <iostream>
#include <fstream>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <cstring>
#include <algorithm>

const int LEN = 32770;
using namespace std;

int A[LEN];
int c = 1;

void print_array()
{
    for(int i = 0; i < 2*c; i++)
        printf("%d ", A[i]);
    printf("\n");
}

void insert(int pos, int n)
{
    int i = pos + c - 1;
    while (i) {
        A[i] -= n;
        i /= 2;
    }
}

int querry(int pos, int s, int f, int a, int b)
{
    if (a <= s && f <= b) return A[pos];
    int mid = (s + f)/2;
    int n = 0, m = 0;
    if (a <= mid)      n = querry(2*pos, s, mid, a, b);
    if (b >= mid + 1)  m = querry(2*pos + 1, mid + 1, f, a, b);

    return m + n;
}

int main()
{
    int N, M;
    freopen("datorii.in" ,"r", stdin);
    freopen("datorii.out", "w", stdout);

    scanf("%d %d", &N, &M);
    while(c < N) c *= 2;
    for(int i = 0; i < 2*c; i++) A[i] = 0;
    for(int i = 1; i <= N; i++)
        scanf("%d", A + c + i - 1);

    int i = c - 1;
    while(i) {
        A[i] = A[2*i] + A[2*i + 1];
        i--;
    }


    int x, y, z, n;
    for(i = 0; i < M; i++) {

        scanf("%d %d %d\n", &x, &y, &z);
        if (x == 1) {n = querry(1, 1, c, y, z); printf("%d\n", n);}
        else insert(y, z);
        //print_array();
    }

    //for(int i = 0; i < 2*c; i++) printf("%d ", A[i]);

    return 0;
}