#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read() {
	char c = getchar();
	ll sum = 0, flag = 1;
	while(!isdigit(c)){if(c == '-')flag = -1;c = getchar();}
	while(isdigit(c)){sum = (sum << 1) + (sum << 3) + (c ^ 48),c = getchar();}
	return sum * flag;
}
inline void write(ll x) {
	if(x < 0) x = (~x) + 1,putchar('-');
	if(x > 9) write(x / 10);
	putchar(x % 10 | 48); 
}
const int N = 2e5 + 5;
int n = read(), m = read(), cnt, root[N], tot = 1;
struct Node {
	int ls, rs;
	ll val;
} f[N << 5];
void push_up(int k) {
	f[k].val = f[f[k].ls].val + f[f[k].rs].val;
}
void buildtree(int &k, int l, int r) {
	k = ++cnt;
	if(l == r) {
		f[k].val = read();
		return ;
	}
	int mid = (l + r) >> 1;
	buildtree(f[k].ls, l, mid);
	buildtree(f[k].rs, mid + 1, r);
	push_up(k);
}
void modify(int &k, int l, int r, int p, ll x) {
	if(!k) k = ++cnt;
	f[k].val += x;
	if(l == r)
		return ;
	int mid = (l + r) >> 1;
	if(p <= mid)
		modify(f[k].ls, l, mid, p, x);
	else
		modify(f[k].rs, mid + 1, r, p, x);
}
void Merge(int &x, int y) {
	if(!x || !y) {
		x |= y;
		return ;
	}
	f[x].val += f[y].val;
	Merge(f[x].ls, f[y].ls);
	Merge(f[x].rs, f[y].rs);
}
int Split(int &k, int l, int r, int x, int y) {
	if(!k)
		return 0;
	int rt = ++cnt;
	if(l >= x && r <= y) {
		f[rt].val += f[k].val;
		k = 0;
		return rt;
	} 
	int mid = (l + r) >> 1;
	if(x <= mid) f[rt].ls = Split(f[k].ls, l, mid, x, y);
	if(y > mid) f[rt].rs = Split(f[k].rs, mid + 1, r, x, y);
	push_up(k), push_up(rt);
	return rt;
}
ll query(int k, int l, int r, int x, int y) {
	if(!k)
		return 0;
	if(l >= x && r <= y) 
		return f[k].val;
	int mid = (l + r) >> 1;
	ll res = 0;
	if(x <= mid) res += query(f[k].ls, l, mid, x, y);
	if(y > mid) res += query(f[k].rs, mid + 1, r, x, y);
	return res;
}
ll queryk(int k, int l, int r, ll kth) {
	if(l == r)
		return l;
	int mid = (l + r) >> 1;
	if(kth <= f[f[k].ls].val)
		return queryk(f[k].ls, l, mid, kth);
	else
		return queryk(f[k].rs, mid + 1, r, kth - f[f[k].ls].val);
}
int main() {
	buildtree(root[1], 1, n);
	for(int i = 1; i <= m; ++i) {
		ll op = read(), x, y, p;
		switch(op) {
			case 0 : {
				p = read(), x = read(), y = read();
				root[++tot] = Split(root[p], 1, n, x, y);
				break;
			}
			case 1 : {
				x = read(), y = read();
				Merge(root[x], root[y]);
				break;
			}
			case 2 : {
				p = read(), x = read(), y = read();
				modify(root[p], 1, n, y, x);
				break;
			}
			case 3 : {
				p = read(), x = read(), y = read();
				write(query(root[p], 1, n, x, y)), putchar('\n');
				break;
			}
			case 4 : {
				p = read(), x = read();
				if(x > f[root[p]].val) write(-1);
				else write(queryk(root[p], 1, n, x));
				putchar('\n');
				break;
			}
		}
	}
	return 0;
}