#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

#define MAX 200000
long long A[MAX + 1];
long long B[MAX + 1];
long long sum_B[MAX + 1] = {};

class Node{
    public:
        int numA;
        int numB;

        Node(int a, int b): numA(a), numB(b) {}

        bool operator< (const Node b) const{
            return this->numA < b.numA;
        }

        bool operator> (const Node b) const{
            return this->numA > b.numA;
        }
};

int main(){
    int N, Q;
    cin >> N >> Q;
    for (int i = 1; i <= N; i++)
        cin >> A[i];

    sum_B[0] = 0;
    for (int j = 1; j <= N; j++){
        cin >> B[j];
        sum_B[j] = sum_B[j - 1] + B[j];
    }

    while (Q--){
        int ord, l, r;
        cin >> ord >> l >> r;
        if (ord == 1){
            int x;
            cin >> x;
            for (int i = l; i <= r; i++)
                A[i] += x;
            continue;
        }

        if (l == r){
            cout << A[l] << endl;
            continue;
        }

        long long totalB = - (sum_B[r] - sum_B[l - 1]);
        priority_queue<Node, vector<Node>, greater<Node> > pq;
        for (int i = l; i <= r; i++)
            pq.push(Node(A[i], B[i]));

        while (!pq.empty() && totalB < 0){
            totalB += pq.top().numB * 2;
            if (totalB >= 0)
                break;
            pq.pop();
        }

        long long adj = pq.top().numA;
        cout << adj << endl;

        for (int i = l; i <= r; i++)
            A[i] = adj;
    }

    return 0;
}