#include <stdio.h>
#include <vector>
using namespace std;

int n, m;
int neach[15001];

inline void scad(int zi, int val)
{
    neach[zi]-=val;
}

void interog(int zi1, int zi2)
{
    int sum = 0;
    for (int i = zi1; i <= zi2; ++i)
    {
        sum+=neach[i];
    }
    printf("%d\n", sum);
}

int main()
{
    freopen("datorii.in", "r", stdin);
    freopen("datorii.out", "w", stdout);
    scanf("%d%d", &n, &m);
    int sec;
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d", &sec);
        neach[i] = sec;
    }
    int b, c;
    for (int i = 0; i < m; ++i)
    {
        scanf("%d%d%d", &sec, &b, &c);
        switch(sec)
        {
            case(0): scad(b, c); break;
            case(1): interog(b,c); break;
        }
    }
    return 0;
}