#include <fstream>
#define nmax 15000
using namespace std;
ifstream is ("datorii.in");
ofstream os ("datorii.out");

#define mid (left+right)/2

int Arb[4*nmax];
int N, M, L, R, x, y, t, ANSW;

void Read();
void Update(int,int,int);
void Query(int,int,int);

int main()
{
    Read();
    for(int i = 1; i <= M; ++i)
    {
        is >> t >> y >> x;
        if(t == 0)
            Update(1, 1, N);
        else
        {
            ANSW = 0;
            L = y;
            R = x;
            Query(1, 1, N);
            os << ANSW << "\n";
        }
    }
    is.close();
    os.close();
    return 0;
}
void Read()
{
    is >> N >> M;
    for(int i = 1; i <= N; ++i)
    {
        is >> x;
        x -= 2*x;
        y = i;
        Update(1, 1, N);
    }
}
void Update(int node, int left, int right)
{
    if(left == right)
    {
        Arb[node] -= x;
        return;
    }

    if(y <= mid) Update(2*node, left, mid);
    else Update(2*node+1, mid+1, right);

    Arb[node] = Arb[2*node] + Arb[2*node+1];
}
void Query(int node, int left, int right)
{
    if(left >= L && right <= R)
    {
        ANSW += Arb[node];
        return;
    }

    if(mid >= L) Query(2*node, left, mid);
    if(mid < R) Query(2*node+1, mid+1, right);
}