#include <stdio.h>
#include <ctype.h>
using namespace std;
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
InParser f("aib.in");
OutParser g("aib.out");
int n,m,a[100003],x,st,c,y,dr,mj;
void update(int poz,int x)
{
    for(int i=poz;i<=n;i+=(i&-i))
        a[i]+=x;
}
int query(int poz)
{
    int s=0;
    for(int i=poz;i;i-=(i&-i))
        s+=a[i];
    return s;
}
void sol(int x,int y)
{
    g<<query(y)-query(x-1)<<'\n';
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        update(i,x);
    }
    for(int t=1;t<=m;t++)
    {
        f>>c;
        if(c==0)
        {
            f>>x>>y;
            update(x,y);
        }
        else
        if(c==1)
        {
            f>>x>>y;
            sol(x,y);
        }
        else
        {
            f>>x;
            st=1;dr=n;
            int vv=-1;
            while(st<=dr)
            {
                mj=(st+dr)/2;
                int w=query(mj);
                if(w==x)
                    vv=mj,st=dr+1;
                if(w>x)
                    dr=mj-1;
                else
                    st=mj+1;
            }
            g<<vv<<'\n';
        }
    }
    return 0;
}