sol

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e6 + 10;
int sum[maxn << 2], ma[maxn << 2], a[maxn];
int n, q, l, r, x, v, op;
void build(int p, int l, int r) {
    if (l == r) {
        ma[p] = a[l];
        sum[p] = a[l];
        return;
    }
    int mid = (l + r) / 2;
    build(p * 2, l, mid);
    build(p * 2 + 1, mid + 1, r);
    ma[p] = max(ma[p * 2], ma[p * 2 + 1]);
    sum[p] = sum[p * 2] + sum[p * 2 + 1];
}
void modify(int p, int l, int r, int x, int v) {
    if (l == r) {
        ma[p] += v;
        sum[p] += v;
        return;
    }
    int mid = (l + r) / 2;
    if (x <= mid)
        modify(p * 2, l, mid, x, v);
    else
        modify(p * 2 + 1, mid + 1, r, x, v);
    ma[p] = max(ma[p * 2], ma[p * 2 + 1]);
    sum[p] = sum[p * 2] + sum[p * 2 + 1];
}
int query(int p, int l, int r, int x, int y) {
    if (r < x || l > y)
        return 0;
    if (x <= l && r <= y)
        return sum[p];

    int mid = (l + r) / 2;
    return query(p * 2, l, mid, x, y) + query(p * 2 + 1, mid + 1, r, x, y);
}
signed main() {
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    build(1, 1, n);
    for (int i = 1; i <= q; ++i) {
        scanf("%lld", &op);
        if (op == 1) {
            scanf("%lld %lld", &x, &v);
            modify(1, 1, n, x, v);
        } else {
            scanf("%lld %lld", &l, &r);
            printf("%lld\n", query(1, 1, n, l, r));
        }
    }
    return 0;
}