#include <iostream>
#include <fstream>
#include <vector>
#include <string>
using namespace std;
#define INT_MAX 2147483647;
int v[400040];

void update(int nod, int st, int dr, int pos, int val, bool modify = false)
{

    if (st == dr)
    {
        if (modify)
            v[nod] -= val; // s-a mai platit din rata
        else
            v[nod] = val; 
    }
    else
    {
        int mij = (st + dr) / 2;
        if (mij >= pos)
            update(nod * 2, st, mij, pos, val, modify);
        else
            update(nod * 2 + 1, mij + 1, dr, pos, val, modify);
        v[nod] = v[nod * 2] + v[nod * 2 + 1];
    }
}
int call(int nod, int st, int dr, int a, int b) {
    if (a <= st && dr <= b) {
        return v[nod];
    }
    else {
        int mij = (st + dr) / 2,
            min_st = 0,
            min_dr = 0;
        if (mij >= a)
            min_st = call(nod * 2, st, mij, a, b);
        if (mij + 1 <= b)
            min_dr = call(nod * 2 + 1, mij + 1, dr, a, b);
        return min_st + min_dr;
    }
}
int main(void)
{
    int n, m, x, c, a, b;
    ifstream f("datorii.in");
    ofstream g("datorii.out");

    f >> n >> m;
    for (int i = 1; i <= n; ++i) {
        f >> x;
        //int nod, int st, int dr, int pos, int val
        update(1, 1, n, i, x);
    }
    for (int i = 1; i <= m; ++i)
    {
        f >> c >> a >> b;
        if (c == 1) {
            g << call(1, 1, n, a, b) << '\n';
        }
        else
        {
            update(1, 1, n, a, b, 1);
        }
    }
}