#include <cstdio>
#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:
        long long numA;
        long long numB;

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

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

        bool operator> (const Node b) const{
            return this->numA > b.numA;
        }
}Nodes[MAX + 1];

int main(){
    int N, Q;
    scanf("%d %d", &N, &Q);
    for (int i = 1; i <= N; i++)
        scanf("%lld", &A[i]);

    sum_B[0] = 0;
    for (int j = 1; j <= N; j++){
        scanf("%lld", &B[j]);
        Nodes[j] = Node(A[j], B[j]);
        sum_B[j] = sum_B[j - 1] + B[j];
    }

    while (Q--){
        int ord, l, r;
        scanf("%d %d %d", &ord, &l, &r);
        if (ord == 1){
            int x;
            scanf("%d", &x);
            for (int i = l; i <= r; i++)
                Nodes[i].numA += x;
            continue;
        }

        if (l == r){
            printf("%lld\n", Nodes[l].numA);
            continue;
        }

        long long totalB = - (sum_B[r] - sum_B[l - 1]);

        sort(Nodes + l, Nodes + r + 1, less<Node>());

        int i = l;
        for (; i <= r; i++)
        {
            totalB += 2 * Nodes[i].numB;
            if (totalB >= 0)    
                break;
        }

        long long adj = Nodes[i].numA;
        printf("%lld\n", adj);

        for (i = l; i <= r; i++){
            Nodes[i].numA = adj;
            Nodes[i].numB = B[i];
        }
    }

    return 0;
}