#include <bits/stdc++.h>

#define int long long

#define fi first
#define se second
#define mkp std::make_pair

typedef long long ll;
typedef std::pair <ll, ll> pii;

const int N = 2e5 + 5, INF = 1e18;

#define sum(o) T[o].sum
#define tag_v(o) T[o].tag_v
#define tag_a(o) T[o].tag_a
struct Seg {
    ll sum;
    int tag_v, tag_a;
    Seg() { tag_a = -INF; tag_v = 0; }
} T[N << 3];
void Update(int o) {
    sum(o) = sum(o << 1) + sum(o << 1 | 1);
}
void GetTag(int o, int l, int r, int v, int a) {
    if(v) {
        sum(o) += 1LL * (r - l + 1) * v;
        tag_v(o) += v;
    }
    if(a > -INF) {
        sum(o) = 1LL * (r - l + 1) * a;
        tag_a(o) = a; tag_v(o) = 0;
    }
}
void PushTag(int o, int l, int r) {
    int mid = (l + r) >> 1;
    if(tag_a(o) > -INF || tag_v(o)) {
        int v = tag_v(o), a = tag_a(o);
        GetTag(o << 1, l, mid, v, a);
        GetTag(o << 1 | 1, mid + 1, r, v, a);
        tag_v(o) = 0; tag_a(o) = -INF;
    }
}
void Modify(int o, int l, int r, int ql, int qr, int v, int a) {
    if(ql <= l && r <= qr) GetTag(o, l, r, v, a);
    else {
        int mid = (l + r) >> 1;
        PushTag(o, l, r);
        if(ql <= mid) Modify(o << 1, l, mid, ql, qr, v, a);
        if(qr > mid) Modify(o << 1 | 1, mid + 1, r, ql, qr, v, a);
        Update(o);
    }
}
ll Query(int o, int l, int r, int p) {
    if(l == r) return sum(o);
    int mid = (l + r) >> 1;
    PushTag(o, l, r);
    if(p <= mid) return Query(o << 1, l, mid, p);
    else return Query(o << 1 | 1, mid + 1, r, p);
}

int n, A[N], B[N]; ll s[N];
void Build(int o, int l, int r) {
    if(l < r) {
        int mid = (l + r) >> 1;
        Build(o << 1, l, mid);
        Build(o << 1 | 1, mid + 1, r);
        Update(o);
    } else sum(o) = A[l];
}

std::set <int> ep;
int Solve(std::vector <pii> &g) {
    std::sort(g.begin(), g.end());
    ll tot = 0;
    for(auto x : g) tot += x.se;
    int i; ll cur = 0;
    //printf("tot = %lld\n", tot);
    for(i = 0; i < g.size(); ++i) {
        cur += g[i].se;
        if(cur >= (tot + 1) / 2) return g[i].fi;
    }
    //printf("cur = %lld %d\n", cur, i);
    return 0;
}
ll GetAns(int l, int r) {
    std::vector <pii> t, g;
    std::vector <int> l_ep;
    auto it = std::prev(ep.upper_bound(l));
    for(; *it <= r; ++it) {
        //std::cerr << *it << std::endl;
        if(*it >= l) l_ep.push_back(*it);
        t.push_back(mkp(std::max(*it, l), std::min(*std::next(it) - 1, r)));
    }
    for(auto x : l_ep) ep.erase(x);
    ep.insert(l);
    ep.insert(r + 1);
    for(auto x : t) {
        int ql = x.fi, qr = x.se;
        //assert(Query(1, 1, n, ql) == Query(1, 1, n, qr));
        //printf("(%d, %lld)\n", Query(1, 1, n, ql), s[qr] - s[ql - 1]);
        g.push_back(mkp(Query(1, 1, n, ql), s[qr] - s[ql - 1]));
    }
    return Solve(g);
}

signed main() {
    int q; scanf("%lld%lld", &n, &q);
    ep.insert(n + 1);
    for(int i = 1; i <= n; ++i) scanf("%lld", A + i), ep.insert(i);
    for(int i = 1; i <= n; ++i) scanf("%lld", B + i), s[i] = s[i - 1] + B[i];
    Build(1, 1, n);
    while(q--) {
        int opt, l, r, x; scanf("%lld%lld%lld", &opt, &l, &r);
        if(opt == 1) {
            scanf("%lld", &x);
            ep.insert(l); ep.insert(r + 1);
            Modify(1, 1, n, l, r, x, -INF);
        } else {
            ll v = GetAns(l, r);
            printf("%lld\n", v);
            Modify(1, 1, n, l, r, 0, v);
        }
        /*for(int i = 1; i <= n; ++i)
            printf("%d ", Query(1, 1, n, i));
        printf("\n");*/
    }
    return 0;
}