#include <fstream>
#define int long long
using namespace std;
ifstream cin ("datorii.in");
ofstream cout ("datorii.out");
int aint[400005];
void update(int nod, int st, int dr, int x, int val)
{
   if(st > x|| dr < x)
      return;
   if(st == dr && st == x)
   {
      aint[nod] += val;
      return;
   }
   int mid = (st + dr) / 2;
   update(nod * 2, st, mid, x, val);
   update(nod * 2 + 1, mid + 1, dr, x, val);
   aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}
int query(int nod, int st, int dr, int x, int y)
{
   if(st > y || dr < x)
      return 0;
   if(x <= st && dr <= y)
      return aint[nod];
   int mid = (st + dr) / 2;
   return query(nod * 2, st, mid, x, y) + query(nod * 2 + 1, mid + 1, dr, x, y);
}
int32_t main()
{
    int n, m, i, a, b, tip;
    cin >> n >> m;
    for(i = 1; i <= n; i ++)
    {
       cin >> a;
       update(1, 1, n, i, -a);
    }
    while(m --)
    {
       cin >> tip >> a >> b;
       if (tip == 0)
         update(1, 1, n, a, b);
       else
         cout << -query(1, 1, n, a, b) << '\n';
    }
    return 0;
}