#include <bits/stdc++.h>
using namespace std;
const int N = 1e7;
struct Node
{
int l, r;
int v, lazy;
}tr[N];
int a[N];
void pushup(int u)
{
tr[u].v = tr[u << 1].v + tr[u << 1 | 1].v;
}
void pushdown(int u)
{
if(tr[u].lazy)
{
auto &root = tr[u], &left = tr[u << 1], &right = tr[u << 1 | 1];
left.v += (left.r - left.l + 1) * root.lazy;
right.v += (right.r - right.l + 1) * root.lazy;
left.lazy += root.lazy;
right.lazy += root.lazy;
root.lazy = 0;
}
}
void bulid(int u, int l, int r)
{
if(l == r) tr[u] = {l, r, a[l], 0};
else
{
tr[u] = {l, r};
int mid = l + r >> 1;
bulid(u << 1, l, mid);
bulid(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
void modify(int u, int x, int v)
{
if(tr[u].l == x && tr[u].r == x) tr[u].v += v;
else
{
pushdown(u);
int mid = tr[u].r + tr[u].l >> 1;
if(x <= mid) modify(u << 1, x, v);
else modify(u << 1 | 1, x, v);
pushup(u);
}
}
int query(int u, int l, int r)
{
if(l <= tr[u].l && tr[u].r <= r) return tr[u].v;
else
{
pushdown(u);
int ans = 0;
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid) ans += query(u << 1, l, r);
if(r > mid) ans += query(u << 1 | 1, l, r);
pushup(u);
return ans;
}
}
int main()
{
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i ++ )
scanf("%d", &a[i]);
bulid(1, 1, n);
while(m -- )
{
int k, a, b;
scanf("%d%d%d", &k, &a, &b);
if(k)
{
modify(1, a, b);
}
else
{
printf("%d\n", query(1, a, b));
}
}
}