#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 500005;
int n, m, op;
ll a[N], tree[4 * N];

void build(int node, int start, int end){
  if(start == end){
    tree[node] = a[start];
    return ;
  }
  int mid = (start + end) / 2;
  int left_node = 2 * node;
  int right_node = 2 * node + 1;
  build(left_node, start, mid);
  build(right_node, mid + 1, end);
  tree[node] = tree[left_node] + tree[right_node];
}

void update(int node, int start, int end, int x, int k){
  if(start == end){
    a[x] += k;
    tree[node] += k;
    return ;
  }
  int mid = (start + end) / 2;
  int left_node = 2 * node;
  int right_node = 2 * node + 1;
  if(x >= start && x <= mid){
    update(left_node, start, mid, x, k);
  } else {
    update(right_node, mid + 1, end, x, k);
  }
  tree[node] = tree[left_node] + tree[right_node];
}

int query(int node, int start, int end, int L, int R){
  if(L <= start && end <= R){
    return tree[node];
  }
  int mid = (start + end) / 2, ans = 0;
  int left_node = 2 * node;
  int right_node = 2 * node + 1;
  if(mid <= L){
    ans += query(left_node, start, mid, L, R);
  } else if(mid > R){
    ans += query(right_node, mid + 1, end, L, R);
  }
  return ans;
}

int main(){
  cin >> n >> m;
  for(int i = 1;i <= n;i++){
    cin >> a[i];
  }
  build(1, 1, n);
  int x, y;
  while(m--){
    cin >> op >> x >> y;
    if(op == 1){
      update(1, 1, n, x, y);
    } else {
      cout << query(1, 1, n, x, y) << endl;
    }
  }
  return 0;
}