#include <iostream>
#include <fstream>
using namespace std;

#define NMAX 100005

int v[NMAX];
int arbint[4 * NMAX + 40];

void Build(int nod, int left, int right) {
   if(left == right) {
      arbint[nod] = v[left];
   }
   else {
      int mid = (left + right) / 2;
      Build(2 * nod, left, mid);
      Build(2 * nod + 1, mid + 1, right);
      arbint[nod] = arbint[2 * nod] + arbint[2 * nod + 1];
   }
}

void Update(int nod, int left, int right, int pos, int val) {
   if(left == right) {
      arbint[nod] += val;
   }
   else {
      int mid = (left + right) / 2;
      if(pos <= mid)
         Update(2 * nod, left, mid, pos, val);
      else
         Update(2 * nod + 1, mid + 1, right, pos, val);
      arbint[nod] = arbint[2 * nod] + arbint[2 * nod + 1];
   }
}

int Query(int nod, int left, int right, int st, int dr) {
   int ans = 0;
   if(left >= st && right <= dr) {
      ans += arbint[nod];
   }
   else {
      int mid = (left + right)/2;
      if(st <= mid) {
         ans += Query(2 * nod, left, mid, st, dr);
      }
      if(mid < dr) {
         ans += Query(2 * nod + 1, mid + 1, right, st, dr);
      }
   }
   return ans;
}


int main()
{
    ifstream cin("aib.in");
    ofstream cout("aib.out");
    int n, m, tip, a, b;
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
      cin >> v[i];
    Build(1, 1, n);
    for(int i = 1; i <= m; ++i) {
      cin >> tip;
      if(tip == 0) {
         cin >> a >> b;
         Update(1, 1, n, a, b);
      }
      if(tip == 1) {
         cin >> a >> b;
         cout << Query(1, 1, n, a, b) << '\n';
      }
      if(tip == 2) {
         cin >> a;
         int st = 1, dr = n, ans = -1;
         while(st <= dr) {
            int mid = (st + dr) / 2;
            int q = Query(1, 1, n, 1, mid);
            if(q >= a) {
               if(q == a)
                  ans = mid;
               dr = mid - 1;
            }
            else
               st = mid + 1;
         }
         cout << ans << '\n';
      }
    }

    return 0;
}