#include <stdio.h>
#include <vector>
#define maxNumber 100005
using namespace std;

int number_of_nodes, queries;

class Binary_Tree{
public:
    // data structures
    int binary[maxNumber];
    // constructors
    void Update(int index, int value);
    int Search(int value);
    int Sum(int position);


};

void Binary_Tree :: Update(int index, int value) {

    while(index <= number_of_nodes)
    {
        binary[index] += value;
        index += (index) & (-index);
    }

}

int Binary_Tree :: Sum(int position) {

    int result = 0;
    while(position)
    {
        result += binary[position];
        position -= (position) & (-position);
    }
    return result;

}

int Binary_Tree :: Search(int value) {

    int mid = 0, left = 1 , right = number_of_nodes, rr;
    while(left <= right)
    {
        mid = (left + right) / 2;
        rr = Sum(mid);
        if(rr == value)
            return  mid;
        if(rr < value)
            left = mid + 1;
        else
            right = mid - 1;
    }
    return -1;
}

int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);

    scanf("%d%d",&number_of_nodes,&queries);
    int type, index, add, find, inter1, inter2;
    Binary_Tree binary_tree;

    for(int i = 1 ; i <= number_of_nodes; i++)
    {
        scanf("%d",&add);
        binary_tree.Update(i,add);
    }

    for(int i = 0 ; i < queries; i++)
    {
        scanf("%d",&type);
        if(type == 0)
        {
            scanf("%d%d",&index,&add);
            binary_tree.Update(index,add);
        }
        if(type == 1)
        {
            scanf("%d%d",&inter1,&inter2);
            printf("%d\n",binary_tree.Sum(inter2) - binary_tree.Sum(inter1 - 1));
        }
        if(type == 2)
        {
            scanf("%d",&find);
            printf("%d\n",binary_tree.Search(find));
        }
    }

    return 0;
}