#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N = 1e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

const double eps = 1e-;

const double PI = acos(-);

int n, q, val[N], k[N];

LL prefix[N];

set<PII> seg;

char op[];

LL a[N << ], add[N << ];

#define lson l, mid, rt << 1

#define rson mid + 1, r, rt << 1 | 1

void push(int rt, int l, int mid, int r) {

    if(add[rt]) {

        a[rt << ] += add[rt] * (mid - l + );

        a[rt <<  | ] += add[rt] * (r - mid);

        add[rt << ] += add[rt];

        add[rt <<  | ] += add[rt];

        add[rt] = ;

    }

}

void build(int l, int r, int rt) {

    if(l == r) {

        a[rt] = val[l];

        return;

    }

    int mid = l + r >> ;

    build(lson); build(rson);

    a[rt] = a[rt << ] + a[rt <<  | ];

}

void update(int L, int R, LL val, int l, int r, int rt) {

    if(l >= L && r <= R) {

        a[rt] += val * (r - l + );

        add[rt] += val;

        return;

    }

    int mid = l + r >> ;

    push(rt, l, mid, r);

    if(L <= mid) update(L, R, val, lson);

    if(R > mid)  update(L, R, val, rson);

    a[rt] = a[rt << ] + a[rt <<  | ];

}

LL query(int L, int R, int l, int r, int rt) {

    if(l >= L && r <= R) return a[rt];

    int mid = l + r >> ;

    push(rt, l, mid, r);

    if(R <= mid) return query(L, R, lson);

    else if(L > mid) return query(L, R, rson);

    else return query(L, R, lson) + query(L, R, rson);

}

int main() {

    scanf("%d", &n);

    for(int i = ; i <= n; i++) {

        scanf("%d", &val[i]);

        prefix[i] = prefix[i - ] + val[i];

    }

    for(int i = ; i < n; i++) scanf("%d", &k[i]);

    for(int i = ; i <= n; i++) seg.insert(mk(i, i));

    build(, n, );

    scanf("%d", &q);

    while(q--) {

        scanf("%s", op);

        if(op[] == '+') {

            int x, v; scanf("%d%d", &x, &v);

            auto sg = seg.upper_bound(mk(x, inf)); sg--;

            int L = sg->fi, R = sg->se;

            seg.erase(sg);

            if(L <= x - ) seg.insert(mk(L, x - ));

            update(x, R, v, , n, );

            while(R < n) {

                LL v1 = query(R, R, , n, );

                LL v2 = query(R + , R + , , n, );

                if(v1 + k[R] <= v2) break;

                LL add = v1 + k[R] - v2;

                auto sg = seg.lower_bound(mk(R + , R + ));

                update(sg->fi, sg->se, add, , n, );

                R = sg->se;

                seg.erase(sg);

            }

            seg.insert(mk(x, R));

        } else {

            int L, R; scanf("%d%d", &L, &R);

            printf("%lld\n", query(L, R, , n, ));

        }

    }

    return ;

}

/*

*/