#include <fstream>
#include <queue>

using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");

int n, m;
int A[15001] = {0};
int c, a, b;

void add(int day, int val)
{
    for(int i = day; i <= n; ++i)
        A[i] -= val;
}

void write(int day1, int day2)
{
    fout << A[day2] - A[day1 - 1] << '\n';
}

int main()
{
    fin >> n >> m >> A[1];
    for(int i = 2; i <= n; ++i)
    {
        fin >> A[i];
        A[i] += A[i - 1];
    }
    for(int i = 1; i <= m; ++i)
    {
        fin >> c >> a >> b;
        if(c)
            write(a, b);
        else
            add(a, b);
    }
    return 0;
}