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

typedef long long ll;
typedef pair <int,int> Pii;
typedef double db;
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
template <class T> inline void cmin(T &a, T b){ ((a>b)&&(a=b)); }
template <class T> inline void cmax(T &a, T b){ ((a<b)&&(a=b)); }

template <class T = int> T rd() {
	T s = 0; int f = 0; char c;
	while(c = getchar(), c < 48) f = c == '-';
	do s = s * 10 + c  -48;
	while(c = getchar(), c > 47);
	return f? -s:s;
}

const int N = 1e6 + 10;
const ll LINF = 1e18 + 10;

int n, m;
int a[N];
ll b[N];
ll s1[N << 2], s2[N << 2];
ll t1[N<<2], t2[N<<2];

void push_up(int p) {
	s1[p] = min(s1[p<<1],s1[p<<1|1]);
	s2[p] = max(s2[p<<1],s2[p<<1|1]);
}
void uset(int p, ll x) {
	t1[p] = s1[p] = s2[p] = x, t2[p] =0;
}
void add(int p, ll x) {
	s1[p] += x, s2[p] += x, t2[p] += x;
}
void push_down(int p) {
	if(t1[p] != LINF) uset(p << 1, t1[p]), uset(p << 1 | 1, t1[p]), t1[p] = LINF;
	if(t2[p]) add(p << 1, t2[p]), add(p << 1| 1,t2[p]), t2[p]=0;
}
void build(int p, int l, int r) {
	t1[p] = LINF;
	if(l == r) {
		s1[p] = s2[p] = a[l];
		return;
	}
	int mid = (l + r) >> 1;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	push_up(p);
}
void uset(int p, int l, int r, int ql, int qr, ll x) {
	// cout << "uset " << p << ' '<<l<<' ' <<r<< ' '<<ql << ' ' << qr<<endl;
	if(ql <= l && r <= qr) return uset(p, x);
	int mid=(l+r)>>1;
	push_down(p);
	if(ql<=mid) uset(p<<1,l,mid,ql,qr,x);
	if(qr>mid) uset(p<<1|1,mid+1,r,ql,qr,x);
	push_up(p);
}
void add(int p, int l, int r, int ql, int qr, ll x) {
	if(ql <= l && r <= qr) return add(p, x);
	int mid=(l+r)>>1;
	push_down(p);
	if(ql<=mid) add(p<<1,l,mid,ql,qr,x);
	if(qr>mid) add(p<<1|1,mid+1,r,ql,qr,x);
	push_up(p);
}

ll query(int p, int l, int r, int x) {
	if(l == r) return s1[p];
	int mid = (l + r) >> 1;
	push_down(p);
	return x <= mid ? query(p << 1, l, mid, x): query(p<<1|1,mid+1,r,x);
}
int get(int p, int l, int r, int x, ll y) {
	if(l >= x) {
		if(s1[p] == y && s2[p] == y) return r + 1;
		if(l == r) return s1[p] == y ? l : l - 1;
		int mid=(l+r)>>1;
		return s1[p << 1] == y && s2[p<<1] == y ? get(p<<1,l,mid,x, y): get(p<<1|1,mid+1,r,x,y);
	}
	push_down(p);
	int mid=(l+r)>>1;
	if(x <= mid) {
		int res = get(p<<1,l,mid,x,y);
		if(res == mid + 1) return get(p << 1 | 1, mid + 1, r, x, y);
		else return res;
	} else {
		return get(p << 1 | 1, mid + 1, r,x, y);
	}
}

struct Node{
	ll x; int l, r;
	bool operator < (const Node __ )const {
		return x < __.x;
	}
} T[N];
ll LS[N], RS[N];
int C;


int main() {
	n = rd(), m =rd();
	rep(i,1,n) a[i] =rd();
	rep(i,1,n) b[i] = b[i-1] + rd();
	build(1,1,n);
	while(m--) {
		int op = rd(), l = rd(), r = rd();
		if(op == 1) add(1,1,n,l,r,rd());
		else {
			C = 0;
			for(int p = l; p <= r;) {
				ll x = query(1,1,n,p);
				int q = min(r, p == n ? n : get(1,1,n,p+1,x));
				T[++C]=(Node){x, p, q};
				p = q + 1;
			}
			sort(T+1,T+C+1);
			// b[i] * abs(x - v)
			ll s = 0;
			rep(i,1,C) {
				LS[i] = LS[i-1] + (T[i].x - T[i-1].x) * s; 
				s += b[T[i].r] - b[T[i].l-1];
			}
			s=0;
			drep(i,C,1) {
				RS[i] = RS[i+1] + (T[i+1].x - T[i].x) * s; 
				s += b[T[i].r] - b[T[i].l-1];
			}
			ll res = 1e18 + 10, v = -1;
			rep(i,1,C) {
				ll w = LS[i] + RS[i];
				if(w < res) res= w, v = T[i].x;
			}
			printf("%lld\n", v);
			uset(1,1,n,l,r,v);
			// puts("uset over");
		}
	}
}