#include <bits/stdc++.h>
using namespace std;
long long n;
long long arr[132000];
long long brr[132000], sum[132000];
long long seg[132000 << 1], tag[132000 << 1];
void push(long long l, long long r, long long p) {
  if (tag[p] != 1234567891234567ll) {
    long long mid = (l + r) >> 1, lch = p << 1, rch = p << 1 | 1;
    seg[lch] = (mid - l + 1) * tag[p];
    seg[rch] = (r - mid) * tag[p];
    tag[lch] = tag[p];
    tag[rch] = tag[p];
    tag[p] = 1234567891234567ll;
  }
}
void pull(long long p) { seg[p] = seg[p << 1] + seg[p << 1 | 1]; }
void build(long long l, long long r, long long p) {
  tag[p] = 1234567891234567ll;
  if (l == r)
    seg[p] = arr[l] - brr[l];
  else {
    long long mid = (l + r) >> 1, lch = p << 1, rch = p << 1 | 1;
    build(l, mid, lch);
    build(mid + 1, r, rch);
    pull(p);
  }
}
void modify(long long l, long long r, long long ql, long long qr, long long p,
            long long val) {
  if (l == ql && r == qr) {
    seg[p] = (r - l + 1) * val;
    tag[p] = val;
  } else {
    long long mid = (l + r) >> 1, lch = p << 1, rch = p << 1 | 1;
    push(l, r, p);
    if (qr <= mid)
      modify(l, mid, ql, qr, lch, val);
    else if (ql > mid)
      modify(mid + 1, r, ql, qr, rch, val);
    else {
      modify(l, mid, ql, mid, lch, val);
      modify(mid + 1, r, mid + 1, qr, rch, val);
    }
    pull(p);
  }
}
long long query(long long l, long long r, long long ql, long long qr,
                long long p) {
  if (l == ql && r == qr) {
    return seg[p];
  } else {
    long long mid = (l + r) >> 1, lch = p << 1, rch = p << 1 | 1;
    push(l, r, p);
    if (qr <= mid)
      return query(l, mid, ql, qr, lch);
    else if (ql > mid)
      return query(mid + 1, r, ql, qr, rch);
    else
      return query(l, mid, ql, mid, lch) + query(mid + 1, r, mid + 1, qr, rch);
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> arr[i];
  for (long long i = 2; i <= n; i++) {
    cin >> brr[i];
    brr[i] += brr[i - 1];
  }
  for (long long i = 1; i <= n; i++) sum[i] = sum[i - 1] + brr[i];
  build(1, n, 1);
  long long q;
  cin >> q;
  while (q--) {
    char c;
    cin >> c;
    if (c == '+') {
      long long pos, add;
      cin >> pos >> add;
      long long val = query(1, n, pos, pos, 1);
      modify(1, n, pos, pos, 1, val + add);
      long long l = pos + 1, r = n, m;
      while (true) {
        if (r - l < 3) {
          for (m = l; m <= r && query(1, n, m, m, 1) <= val + add; m++)
            ;
          m--;
          break;
        }
        m = (l + r) >> 1;
        if (query(1, n, m, m, 1) <= val + add)
          l = m;
        else
          r = m - 1;
      }
      if (m > pos) modify(1, n, pos + 1, m, 1, val + add);
    } else {
      long long l, r;
      cin >> l >> r;
      cout << query(1, n, l, r, 1) + sum[r] - sum[l - 1] << '\n';
    }
  }
  return 0;
}
