#include <std/c++.h>
 
int c[20000], v[20000], n, m, i, j;
 
void chng(int index, int val, char ok)
{
 int p1, p2;
 
 p1 = 0;
 p2 = 1;
 while (indx <= n)
 {
  if (ok == '+')
   c[index] += val;
   else
    c[index] -= val;
 
  while ((index & put) == 0)
  {
   p1++;
   p2 *= 2;
  }
  ind += p2;
 }
}
 

 
int main()
{
    ifstream cin("datorii.in");
	ofstream cout("datorii.out");
	cin >> n >> m;
	for (i=1; i<=n; i++)
                         {
                            cin >> v[i];
                            chng(i, v[i], '+');
                          }
 
    int x, a, b;
    for (j=1; j<=m; j++)
                        {
                          cin >> x;
                          if (x == 1)
                                      {
                                        cin >> a >> b;
                                        cout << sum(a, b) << '\n';
                                      }
                              else
                                      {
                                        cin >> a >> b;
                                        chng(a, b, '-');
                                      }
                        }
 return 0;
 /*
    egdyewgdsgdfiwyefgdhgshcvdteyitfefdyfty
    
    
    jbg
    jhgyfy
    hjvyty
    jhvgtyfr
    bhjghf
    
 */
}