#include <iostream>
#include <fstream>

using namespace std;

int arbint[60001], v[15001];

void build(int node, int left, int right)
{
    if(left == right)
        arbint[node] = v[left];
    else
    {
        int mid = (left + right) / 2;

        build(node * 2, left, mid);
        build(node * 2 + 1, mid + 1, right);

        arbint[node] = arbint[node * 2] + arbint[node * 2 + 1];
    }
}

void update(int node, int left, int right, int poz, int val)
{
    if(left == right)
        arbint[node] -= val;
    else
    {
        int mid = (left + right) / 2;

        if(poz <= mid)
            update(node * 2, left, mid, poz, val);
        else
            update(node * 2 + 1, mid + 1, right, poz, val);

        arbint[node] = arbint[node * 2] + arbint[node * 2 + 1];
    }
}

int query(int node, int left, int right, int query_left, int query_right)
{
    if(query_left <= left  && right <= query_right)
        return arbint[node];
    else
    {
        int mid = (left + right) / 2;

        if(query_right <= mid)
            return query(node * 2, left, mid, query_left, query_right);
        if(query_left >= mid+1)
            return query(node * 2 + 1, mid + 1, right, query_left, query_right);

        return query(node * 2, left, mid, query_left, query_right) + query(node * 2 + 1, mid + 1, right, query_left, query_right);
    }
}

int main()
{
    ifstream fin("datorii.in");
    ofstream fout("datorii.out");
    int n, m;
    fin >> n >> m;

    for(int i = 1; i <= n; i++)
        fin >> v[i];

    build(1, 1, n);

    while(m)
    {
        bool o;
        int a, b;
        fin >> o;
        if(o == 0)
        {
            fin >> a >> b;
            update(1, 1, n, a, b);
        }
        else
        {
            fin >> a >> b;
            fout << query(1, 1, n, a, b) << endl;
        }
        m--;
    }
    return 0;
}


/*#include <iostream>
#include <stdio.h>
#include <ctype.h>
#include <fstream>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

int A[15001], n;

void update(int poz, int val)
{
    for(int i = poz; i <= n; i += (i&-i))
        A[i] += val;
}

int query(int poz)
{
    int s = 0;
    for(int i = poz; i > 0; i -= (i&-i))
        s += A[i];
    return s;
}

int main()
{
    InParser fin("datorii.in");
    OutParser fout("datorii.out");
    int q, x, op, T, V, st, dr, i;
    fin >> n >> q;
    for(i = 1; i <= n; i++)
    {
        fin >> x;
        update(i, x);
    }
    for(i = 1; i <= q; i++)
    {
        fin >> op;
        if(op == 1)
        {
            fin >> st >> dr;
            fout << query(dr) - query(st-1);
            fout << '\n';
        }
        else
        {
            fin >> T >> V;
            update(T, -V);
        }
    }
    return 0;
}
*/