#include <fstream>
#include <vector>
using namespace std;
ifstream is("datorii.in");
ofstream os("datorii.out");
int n, m, arb[15001*4], mij;
int x, y, tip, rez;
void Up( int N, int L, int R, int poz, int val );
void Querry( int N, int L, int R, int a, int b );
int main()
{
is >> n >> m;
for ( int i = 1; i <= n; i++ )
{
is >> x;
Up(1, 1, n, i, x);
}
for ( int i = 1; i <= m; i++ )
{
is >> tip >> x >> y;
if ( tip == 0 )
Up( 1, 1, n, x, -y );
else
{
rez = 0;
Querry( 1, 1, n, x, y );
os << rez << '\n';
}
}
is.close();
os.close();
return 0;
}
void Querry( int N, int L, int R, int a, int b )
{
if ( a <= L && R <= b )
{
rez += arb[N];
return;
}
int mij = ( L + R ) / 2;
if ( a <= mij ) Querry( 2*N, L, mij, a, b );
if ( mij < b ) Querry( 2*N + 1, mij + 1, R, a, b );
}
void Up( int N, int L, int R, int poz, int val )
{
if ( L == R )
arb[N] += val;
else
{
mij = ( L + R ) / 2;
if ( poz <= mij )
Up( 2*N, L, mij, poz, val );
else
Up( 2*N + 1,mij + 1, R, poz, val );
arb[N] = arb[2*N] + arb[2*N+1];
}
}