#include <stdio.h>
using namespace std;
int n,m , arbori[100100];

int sume2(int y)
{
    int sume = 0,dif = ((y^(y-1))&y);
    for(; y > 0 ; y -= dif);
    sume += arbori[y];
    return sume;
}

int searched(int k)
{
    int left = 1;
    int right = n;
    while(left <= right)
    {
        int middle = (left + right)/2;
        int sume_now = sume2(middle);
        if(sume_now == k)
            return middle;
        if(sume_now < k)
            left = middle+1;
        else
            right = middle-1;
    }
    return -1;
}

void creat(int i , int x)
{
    int dif = ((i^(i-1))&i);
    for(int j = i; j <= n ; j+=dif)
    {
        arbori[j] += x;
        dif = ((j^(j-1))&j);
    }
}

void read()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%d %d",&n,&m);
    int nr=0;
    for(int i = 0 ; i < n ; i++)
    {
        scanf("%d ",&nr);
        creat(i+1,nr);
    }
    for(int i = 0 ; i < m ; i++)
    {
        int task,a,b;
        scanf("%d",&task);
        if(task == 1)
        {
            scanf("%d %d",&a,&b);
            printf("%d\n",sume2(b)-sume2(a-1));
            continue;
        }
        if(task == 2)
        {
            scanf("%d",&a);
            printf("%d\n",searched(a));
            continue;
        }
        if(task == 0)
        {
            scanf("%d %d",&a,&b);
            creat(a,b);
            continue;
        }
    }
}

int main()
{
    read();
    return 0;
}