#include "bits/stdc++.h"
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<LL, LL> PII;

const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL) INF;

const int MAX = 1000200;
// const int MAX = 100;


int A[MAX];
int B[MAX];
LL SB[MAX];

int mrand()
{
	return abs((rand() << 16) ^ rand());
}
struct node
{
	int l, r;	// children
	int y;		// priority (should be random and different)
	int cnt;	// size of subtree
	int par;	// parent of the vertex
	LL val;	// value of the vertex
	LL push;	// reverse push

	int ll;
	int rr;
	
	void init(LL val, int ll, int rr) // init with value
	{
		l = r = -1;
		y = mrand();
		cnt = 1;
		par = -1;
		this->val = val;
		this->ll = ll;
		this->rr = rr;
		this->push = 0;
	}
};
// Minimum on subtree + reverse
struct Treap
{
	node A[MAX];
	int sz;
	int getCnt(int x)
	{
		if (x == -1) return 0;
		return A[x].cnt;
	}
	int newNode(LL val, int ll, int rr)
	{
		A[sz].init(val, ll, rr);
		sz++;
		return sz - 1;
	}
	int PB(int root, LL val, int ll, int rr)
	{
		return merge(root, newNode(val, ll, rr));
	}
	void upd(int x)
	{
		if (x == -1) return;
		A[x].cnt = getCnt(A[x].l) + getCnt(A[x].r) + 1;
	}
	void add(int x, int val)
	{
		if (x == -1) return;
		A[x].val += val;
		A[x].push += val;
	}
	void push(int x)
	{
		if (x == -1 || A[x].push == 0) return;
		add(A[x].l, A[x].push);
		add(A[x].r, A[x].push);
		A[x].push = 0;
	}
	PII split(int x, int cnt)
	{
		if (x == -1) return MP(-1, -1);
		if (cnt == 0) return MP(-1, x);
		push(x);
		int left = getCnt(A[x].l);
		PII res;
		if (left >= cnt)
		{
			if (A[x].l != -1) A[A[x].l].par = -1;
			res = split(A[x].l, cnt);
			A[x].l = res.second;
			if (res.second != -1) A[res.second].par = x;
			res.second = x;
		}
		else
		{
			if (A[x].r != -1) A[A[x].r].par = -1;
			res = split(A[x].r, cnt - left - 1);
			A[x].r = res.first;
			if (res.first != -1) A[res.first].par = x;
			res.first = x;
		}
		upd(x);
		return res;
	}
	int merge(int x, int y)
	{
		if (x == -1) return y;
		if (y == -1) return x;
		int res;
		//if (mrand() % (getCnt(x) + getCnt(y)) < getCnt(x))
		if (A[x].y > A[y].y)
		{
			push(x);
			if (A[x].r != -1) A[A[x].r].par = -1;
			res = merge(A[x].r, y);
			A[x].r = res;
			if (res != -1) A[res].par = x;
			res = x;
		}
		else
		{
			push(y);
			if (A[y].l != -1) A[A[y].l].par = -1;
			res = merge(x, A[y].l);
			A[y].l = res;
			if (res != -1) A[res].par = y;
			res = y;
		}
		upd(res);
		return res;
	}

	int getCntLeft(int x)
	{
		int prev = -1;
		int res = 0;
		while(true)
		{
			if (prev != A[x].l) res += getCnt(A[x].l);
			int par = A[x].par;
			if (par == -1) break;
			prev = x;
			if (A[par].r == x) res++;
			x = par;
		}

		return res;
	}

	int dfs_find(int x, int pos)
	{
		// cout<<x<<' '<<pos<<": "<<A[x].ll<<' '<<A[x].rr<<' '<<A[x].l<<' '<<A[x].r<<endl;
		if (A[x].ll <= pos && pos <= A[x].rr) return x;
		if (pos < A[x].ll) return dfs_find(A[x].l, pos);
		return dfs_find(A[x].r, pos);
	}

	void get_v(int x, vector<PII>& v)
	{
		if (x == -1) return;
		push(x);
		get_v(A[x].l, v);
		LL val = A[x].val;
		// LL cnt = A[x].rr - A[x].ll + 1;
		LL sum = SB[A[x].rr];
		if (A[x].ll != 0) sum -= SB[A[x].ll-1];
		v.PB(MP(val, sum));

		get_v(A[x].r, v);
	}

	void print(int x)
	{
		if (x == -1) return;
		print(A[x].l);
		// cout<<x<<' '<<A[x].val<<' '<<A[x].ll<<' '<<A[x].rr<<", ";

		print(A[x].r);
	}
} T;


int split_vertex_left(int x, int mid)
{
	int y = T.newNode(T.A[x].val, T.A[x].ll, mid - 1);
	T.A[x].ll = mid;
	// cout<<"@@ "<<x<<": "<<T.A[x].ll<<' '<<T.A[x].rr<<endl;
	// cout<<"@@ "<<y<<": "<<T.A[y].ll<<' '<<T.A[y].rr<<endl;
	return y;
}

int split_vertex_right(int x, int mid)
{
	// cout<<"# "<<x<<' '<<T.A[x].ll<<' '<<T.A[x].rr<<": "<<mid<<endl;
	int y = T.newNode(T.A[x].val, mid + 1, T.A[x].rr);
	T.A[x].rr = mid;
	// cout<<"## "<<x<<": "<<T.A[x].ll<<' '<<T.A[x].rr<<endl;
	// cout<<"## "<<y<<": "<<T.A[y].ll<<' '<<T.A[y].rr<<endl;
	return y;
}

pair<int, PII> getLR(int root, int l, int r)
{
	int x = T.dfs_find(root, l);
	int y = T.dfs_find(root, r);
	// cout<<root<<' '<<l<<' '<<r<<endl;

	// cout<<"! "<<x<<' '<<y<<endl;


	PII a = T.split(root, T.getCntLeft(x));
	PII b = T.split(a.second, T.getCntLeft(y) + 1);

	root = b.first;

	if (T.A[x].ll != l)
	{
		int v = split_vertex_left(x, l);
		a.first = T.merge(a.first, v);
	}

	if (T.A[y].rr != r)
	{
		int v = split_vertex_right(y, r);
		b.second = T.merge(v, b.second);
	}

	return MP(a.first, MP(b.first, b.second));
}

int root;

void update(int l, int r, int x)
{
	auto R = getLR(root, l, r);
	int mr = R.second.first;

	T.add(mr, x);

	root = T.merge(R.first, T.merge(R.second.first, R.second.second));
}

int update(int l, int r)
{
	// cout<<"update "<<l<<' '<<r<<endl;
	auto R = getLR(root, l, r);

	// cout<<R.first<<' '<<R.second.first<<' '<<R.second.second<<endl;

	vector<PII> v;
	T.get_v(R.second.first, v);

	// FOR (i, 0, SZ(v))
	// {
	// 	cout<<v[i].first<<' '<<v[i].second<<", ";
	// }
	// cout<<endl;

	sort(ALL(v));
	LL s = 0;

	FOR (i, 0, SZ(v))
	{
		s += v[i].second;

	}

	LL c = 0;
	LL val = -1;
	FOR (i, 0, SZ(v))
	{
		c += v[i].second;
		if (c * 2 >= s)
		{
			val = v[i].first;
			break;
		}
	}

	int x = T.newNode(val, l, r);

	root = T.merge(R.first, T.merge(x, R.second.second));

	return val;
}

int main(int argc, char* argv[])
{
	//ios::sync_with_stdio(false); cin.tie(0);
	// cout<<"&"<<endl;

	int n, q;
	scanf("%d%d", &n, &q);

	FOR (i, 0, n)
	{
		scanf("%d", &A[i]);
	}

	FOR (i, 0, n)
	{
		scanf("%d", &B[i]);
	}

	FOR (i, 0, n)
	{
		SB[i] = B[i];
		if (i != 0) SB[i] += SB[i-1];
	}

	// cout<<"*"<<endl;

	root = -1;
	FOR (i, 0, n)
	{
		root = T.PB(root, A[i], i, i);
	}

	FOR (i, 0, q)
	{
		// cout<<"===> ";
		// T.print(root);
		// cout<<endl;
		// cout<<"! "<<i<<endl;
		int t;
		scanf("%d", &t);
		if (t == 1)
		{
			int l, r, x;
			scanf("%d%d%d", &l, &r, &x);
			l--;
			r--;
			update(l, r, x);
		}
		if (t == 2)
		{
			int l, r;
			scanf("%d%d", &l, &r);
			l--;
			r--;
			LL res = update(l, r);
			printf("%lld\n", res);
		}
	}
	// cout<<"===> ";
	// T.print(root);
	// cout<<endl;

}