#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
const int NMAX = 15e3;
int n, q, c, x, y, aib[NMAX + 2];

int lsb(int x) {
  return x & (-x);
}

void update(int x, int y) {
  for (int i = x; i <= n; i += lsb(i)) {
    aib[i] += y;
  }
}

ll query(int x) {
  ll rez = 0;
  while (x > 0) {
    rez += aib[x];
    x -= lsb(x);
  }
  return rez;
}

int main() {
  fin >> n >> q;
  for (int i = 1; i <= n; i++) {
    fin >> x;
    update(i, x);
  }

  while (q--) {
    fin >> c >> x >> y;
    if (c == 0) {
      update(x, -y);
    }
    else {
      fout << query(y) - query(x - 1) << '\n';
    }
  }

  return 0;
}