#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef long double ld;

inline void debugMode() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    #ifndef ONLINE_JUDGE
    freopen("datorii.in", "r", stdin);
    freopen("datorii.out", "w", stdout);
    #endif // ONLINE_JUDGE
}
inline void PrintYes() { cout << "Yes"; }
inline void PrintNo() { cout << "No"; }

const double eps = 1e-7;
const int Nmax = 15e3 + 5;

int n, m;
int tree[4 * Nmax];
int a[Nmax];

void buildTree(int nod, int l, int r)
{
    if(l == r) {
        tree[nod] = a[l];
        return;
    }

    int mid = (l + r) >> 1;
    buildTree(2 * nod, l, mid);
    buildTree(2 * nod + 1, mid + 1, r);

    tree[nod] = tree[2 * nod] + tree[2 * nod + 1];
}

void update(int nod, int l, int r, int t, int val)
{
    tree[nod] -= val;

    if(l == r && l == t) {
        tree[nod] -= val;
        return;
    }

    int mij = (l + r) >> 1;
    if(t <= mij)
        update(2 * nod, l, mij, t, val);
    else
        update(2 * nod + 1, mij + 1, r, t, val);
}

int query(int nod, int l, int r, int a, int b)
{
    if(a <= l && r <= b)
        return tree[nod];
    if(b < l || a > r)
        return 0;

    int mid = (l + r) >> 1;
    int val1 = query(2 * nod, l, mid, a, b);
    int val2 = query(2 * nod + 1, mid + 1, r, a, b);
    return val1 + val2;
}

int main()
{
    debugMode();

    cin >> n >> m;

    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    buildTree(1, 1, n);

    //for(int i = 1; i <= 11; ++i)
      //  cout << tree[i] << " ";

    for(int i = 1; i <= m; ++i) {
        int op, a ,b;
        cin >> op >> a >> b;
        if(op == 1) {
            int val = query(1, 1, n, a, b);
            cout << val << '\n';
        }
        else {
            update(1, 1, n, a, b);
        }
    }

    return 0;
}