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

#define ll long long
#define lx t[x].l
#define rx t[x].r

const int maxn=2e5+10;
const ll inf=1e18;

int a[maxn];
int b[maxn];
ll tag[maxn<<2];
ll pls[maxn<<2];
ll sum[maxn];
map<ll,ll> mapp;
struct Node
{
	ll val,sum;	
};

void build(int x,int l,int r)
{
	tag[x]=inf;
	if(l==r) return tag[x]=a[l],void();
	int mid=l+r>>1;
	build(x<<1,l,mid);
	build(x<<1|1,mid+1,r);
}

void push_pls(int x,ll val)
{
	if(tag[x]!=inf) tag[x]+=val;
	else pls[x]+=val;
}

void push_tag(int x,ll val)
{
	tag[x]=val,pls[x]=0;	
}

void push_down(int x)
{
	if(tag[x]!=inf)
	{
		push_tag(x<<1,tag[x]);
		push_tag(x<<1|1,tag[x]);
		tag[x]=inf;
	}
	else
	{
		push_pls(x<<1,pls[x]);
		push_pls(x<<1|1,pls[x]);
		pls[x]=0;
	}
}

void modify(int x,int l,int r,int left,int right,int val)
{
	if(l>=left&&r<=right)
	{
		push_pls(x,val);
		return;
	}
	push_down(x);
	int mid=l+r>>1;
	if(left<=mid) modify(x<<1,l,mid,left,right,val);
	if(right>mid) modify(x<<1|1,mid+1,r,left,right,val);
}

void modify2(int x,int l,int r,int left,int right,ll val)
{
	if(l>=left&&r<=right)
	{
		push_tag(x,val);
		return;
	}
	push_down(x);
	int mid=l+r>>1;
	if(left<=mid) modify2(x<<1,l,mid,left,right,val);
	if(right>mid) modify2(x<<1|1,mid+1,r,left,right,val);
}

void dfs(int x,int l,int r,int left,int right)
{
	int mid=l+r>>1;
	if(l>=left&&r<=right)
	{
		if(tag[x]!=inf) mapp[tag[x]]+=sum[r]-sum[l-1];
		else dfs(x<<1,l,mid,left,right),dfs(x<<1|1,mid+1,r,left,right);
		return;
	}
	push_down(x);
	if(left<=mid) dfs(x<<1,l,mid,left,right);
	if(right>mid) dfs(x<<1|1,mid+1,r,left,right);
}

int main()
{
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]),sum[i]=sum[i-1]+b[i];
	build(1,1,n);
	while(q--)
	{
		int opt,l,r;
		scanf("%d%d%d",&opt,&l,&r);
		if(opt==1)
		{
			int x;
			scanf("%d",&x);
			modify(1,1,n,l,r,x);
		}
		else
		{
			mapp.clear();
			dfs(1,1,n,l,r);
			vector<Node> vec;
			ll tmpsum=0,tmp=0;
			for(auto v:mapp) tmpsum+=v.second,vec.push_back((Node){v.first,v.second});
			for(int i=0;i<vec.size();i++)
			{
				tmp+=vec[i].sum;
				if(tmp>=tmpsum-tmp)
				{
					modify2(1,1,n,l,r,vec[i].val);
					printf("%lld\n",vec[i].val);
					break;
				}
			}
		}
	}
	return 0;
}