#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

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

const LL LINF = 1e18;

struct Segtree
{
	int n;
	vector<PLL> t;
	
	void init(int _n)
	{
		n = 1;
		while (n < _n) n *= 2;
		t.assign(n * 2 - 1, {LINF, 0});
	}
	
	void push(int v, int tl, int tr)
	{
		if (tl + 1 == tr) return;
		if (t[v].F != LINF)
		{
			t[v * 2 + 1] = {t[v].F, 0};
			t[v * 2 + 2] = {t[v].F, 0};
		}
		t[v * 2 + 1].S += t[v].S;
		t[v * 2 + 2].S += t[v].S;
		t[v] = {LINF, 0};
	}
	
	LL query(int v, int tl, int tr, int i)
	{
		push(v, tl, tr);
		if (tl + 1 == tr)
		{
			return t[v].F + t[v].S;
		}
		int tm = (tl + tr) / 2;
		if (tm > i)
			return query(v * 2 + 1, tl, tm, i);
		else
			return query(v * 2 + 2, tm, tr, i);
	}
	
	LL query(int i)
	{
		return query(0, 0, n, i);
	}
	
	void upd(int v, int tl, int tr, int l, int r, PLL x)
	{
		push(v, tl, tr);
		if (tl >= r || l >= tr)
			return;
		if (l <= tl && tr <= r)
		{
			t[v] = x;
			push(v, tl, tr);
			return;
		}
		int tm = (tl + tr) / 2;
		upd(v * 2 + 1, tl, tm, l, r, x);
		upd(v * 2 + 2, tm, tr, l, r, x);
	}
	
	void upd(int l, int r, PLL x)
	{
		return upd(0, 0, n, l, r, x);
	}

};




int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, q;
	cin >> n >> q;
	Segtree st;
	st.init(n);
	set<int> pos;
	FOR (i, 0, n)
	{
		int a;
		cin >> a;
		st.upd(i, i + 1, {a, 0});
		pos.insert(i);
	}
	pos.insert(n);
	vector<LL> b(n + 1);
	FOR (i, 0, n)
	{
		cin >> b[i + 1];
		b[i + 1] += b[i];
	}
	FOR (iter, 0, q)
	{
		int t;
		cin >> t;
		if (t == 1)
		{
			int l, r, x;
			cin >> l >> r >> x;
			l--;
			pos.insert(l);
			pos.insert(r);
			st.upd(l, r, {LINF, x});
		}
		else
		{
			int l, r;
			cin >> l >> r;
			l--;
			pos.insert(l);
			pos.insert(r);
			vector<PLL> v;
			auto it = pos.lower_bound(l);
			while (*it != r)
			{
				int ps = *it;
				LL x = st.query(ps);
				it++;
				pos.erase(prev(it));
				v.PB({x, b[*it] - b[ps]});
			}
			pos.insert(l);
			sort(ALL(v));
			__int128 sum = 0;
			FOR (i, 0, SZ(v))
				sum += v[i].S;
			__int128 pref = 0;
			int j = -1;
			FOR (i, 0, SZ(v))
			{
				pref += v[i].S;
				if (pref * 2 >= sum)
				{
					j = i;
					break;
				}
			}
			st.upd(l, r, {v[j].F, 0});
			cout << v[j].F << '\n';
			
		}
	}
	
	
	return 0;
}