#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
struct greateri {
  template <class T>
  bool operator()(T const &a, T const &b) const {
    return a > b;
  }
};
void setIO(string s) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
long long seg[800001], seg1[800001];
long long seg2[800001], seg3[800001];
long long cura[200001];
vector<long long> initial, fat, nowi, nowi1;
long long n;
long long BIT[800001];
long long curi[800001], casi[800001];
void build(long long p, long long l, long long r, long long yo) {
  if (l == r) {
    if (!yo) {
      if (!l)
        seg[p] = 0;
      else
        seg[p] = (nowi[l] * (fat[l] - fat[l - 1] - 1)) % 1000000007;
    } else {
      if (l == (n - 1))
        seg1[p] = 0;
      else
        seg1[p] = (nowi1[l] * (fat[l + 1] - fat[l] - 1)) % 1000000007;
    }
    return;
  }
  long long med = (l + r) / 2;
  build(p * 2, l, med, yo);
  build(p * 2 + 1, med + 1, r, yo);
  if (!yo) {
    seg[p] = (seg[p * 2] + seg[p * 2 + 1]) % 1000000007;
  } else
    seg1[p] = (seg1[p * 2] + seg1[p * 2 + 1]) % 1000000007;
}
void build3(long long p, long long l, long long r) {
  if (l == r) {
    if (!l)
      seg2[p] = 0;
    else
      seg2[p] = (fat[l] - fat[l - 1] - 1) % 1000000007;
    if (l == (n - 1))
      seg3[p] = 0;
    else
      seg3[p] = (fat[l + 1] - fat[l] - 1) % 1000000007;
    cura[l] = seg2[p];
    casi[l] = seg3[p];
    return;
  }
  long long med = (l + r) / 2;
  build3(p * 2, l, med);
  build3(p * 2 + 1, med + 1, r);
  seg2[p] = (seg2[p * 2] + seg2[p * 2 + 1]);
  seg3[p] = (seg3[p * 2] + seg3[p * 2 + 1]);
}
pair<long long, long long> queri(long long p, long long l, long long r,
                                 long long l1, long long r1) {
  if (l > r1 || l1 > r) return {0, 0};
  if (l >= l1 && r <= r1) return {seg2[p], seg3[p]};
  long long med = (l + r) / 2;
  auto u = queri(p * 2, l, med, l1, r1);
  auto v = queri(p * 2 + 1, med + 1, r, l1, r1);
  return {(u.first + v.first), (u.second + v.second)};
}
vector<long long> bos, fos;
long long lazy[800001], lazy1[800001];
long long l;
void prop(long long node, long long l, long long r, long long in) {
  if (l != r) {
    long long med = (l + r) / 2;
    auto u = 0;
    auto v = 0;
    if (!in) {
      if (!l)
        u = fos[med];
      else
        u = fos[med] - fos[l - 1];
      if (!(med + 1))
        v = bos[r];
      else
        v = bos[r] - bos[med];
      seg[node * 2] =
          (seg[node * 2] + (((u)*lazy[node]) % 1000000007)) % 1000000007;
      seg[node * 2 + 1] =
          (seg[node * 2 + 1] + (((v)*lazy[node]) % 1000000007)) % 1000000007;
      lazy[node * 2] += lazy[node];
      lazy[node * 2 + 1] += lazy[node];
      lazy[node] = 0;
    } else {
      if (!l)
        u = fos[med];
      else
        u = fos[med] - fos[l - 1];
      if (!(med + 1))
        v = bos[r];
      else
        v = bos[r] - bos[med];
      seg1[node * 2] =
          (seg1[node * 2] + ((u)*lazy1[node]) % 1000000007) % 1000000007;
      seg1[node * 2 + 1] =
          (seg1[node * 2 + 1] + ((v)*lazy1[node]) % 1000000007) % 1000000007;
      lazy1[node * 2] += lazy1[node];
      lazy1[node * 2 + 1] += lazy1[node];
      lazy1[node] = 0;
    }
  }
}
void badel(long long p, long long l, long long r, long long l1, long long r1,
           long long val, long long sasy) {
  if (l1 > r1) return;
  if (l > r1 || r < l1) return;
  if (l >= l1 && r <= r1) {
    auto cur = 0;
    if (!sasy) {
      if (!l)
        cur = fos[r];
      else
        cur = fos[r] - fos[l - 1];
      seg[p] = (seg[p] + ((cur)*val) % 1000000007) % 1000000007;
      lazy[p] += val;
    } else {
      if (!l)
        cur = bos[r];
      else
        cur = bos[r] - bos[l - 1];
      seg1[p] = (seg1[p] + ((cur)*val) % 1000000007) % 1000000007;
      lazy1[p] += val;
    }
    prop(p, l, r, sasy);
    return;
  }
  prop(p, l, r, sasy);
  long long med = (l + r) / 2;
  badel(p * 2, l, med, l1, r1, val, sasy);
  badel(p * 2 + 1, med + 1, r, l1, r1, val, sasy);
  if (!sasy) {
    seg[p] = (seg[p * 2] + seg[p * 2 + 1]) % 1000000007;
  } else
    seg1[p] = (seg1[p * 2] + seg1[p * 2 + 1]) % 1000000007;
}
long long lawej(long long p, long long l, long long r, long long l1,
                long long r1, long long sasy) {
  if (l1 > r1) return 0;
  if (l > r1 || r < l1) return 0;
  if (l >= l1 && r <= r1) {
    if (!sasy) return seg[p];
    return seg1[p];
  }
  prop(p, l, r, sasy);
  long long med = (l + r) / 2;
  return (lawej(p * 2, l, med, l1, r1, sasy) +
          lawej(p * 2 + 1, med + 1, r, l1, r1, sasy));
}
void update(long long index, long long val) {
  for (index++; index <= n; index += (index & (-index))) {
    BIT[index] += val;
  }
}
long long query(long long index) {
  long long result = 0;
  for (index++; index > 0; index -= (index & (-index))) {
    result = (result + BIT[index]);
  }
  return result;
}
long long range(long long l, long long r) {
  if (l > r) return 0;
  return ((query(r) - query(l - 1)));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long q;
  cin >> n >> q;
  l = log2(n);
  for (long long i = 0; i < n; ++i) {
    long long xo;
    cin >> xo;
    fat.push_back(xo);
  }
  for (long long i = 0; i < n; ++i) {
    long long yo;
    cin >> yo;
    initial.push_back(yo);
    curi[i] = yo;
    update(i, yo);
  }
  long long cumi = 0;
  vector<long long> useful;
  for (long long i = 0; i < n; ++i) {
    nowi.push_back(cumi);
    cumi = (cumi + initial[i]);
    useful.push_back(cumi);
  }
  cumi = 0;
  for (long long i = n - 1; i >= 0; --i) {
    nowi1.push_back(cumi);
    cumi = (cumi + initial[i]);
  }
  reverse(nowi1.begin(), nowi1.end());
  build(1, 0, n - 1, 0);
  build(1, 0, n - 1, 1);
  build3(1, 0, n - 1);
  cumi = 0;
  for (int i = 0; i < n; ++i) {
    cumi += cura[i];
    fos.push_back(cumi);
  }
  cumi = 0;
  for (int i = 0; i < n; ++i) {
    cumi += casi[i];
    bos.push_back(cumi);
  }
  while (q--) {
    long long x;
    cin >> x;
    if (x < 0) {
      x = -x - 1;
      long long newi;
      long long lasti = curi[x];
      cin >> newi;
      update(x, newi - lasti);
      badel(1, 0, n - 1, x + 1, n - 1, newi - lasti, 0);
      badel(1, 0, n - 1, 0, x - 1, newi - lasti, 1);
      curi[x] = newi;
    } else {
      long long r;
      cin >> r;
      long long l = x;
      l--, r--;
      long long low = l;
      long long high = r;
      long long besti = l;
      while (low <= high) {
        long long med = (low + high) / 2;
        long long k = range(l, med - 1);
        long long f = range(med, r);
        if ((k - f) < 0) {
          besti = med;
          low = med + 1;
        } else {
          high = med - 1;
        }
      }
      long long fol = 0;
      if (!l)
        fol = fos[besti];
      else
        fol = fos[besti] - fos[l - 1];
      long long sol = 0;
      if (!besti)
        sol = bos[r];
      else
        sol = bos[r] - bos[besti - 1];
      auto kal = range(0, l - 1) % 1000000007;
      auto nal = range(r + 1, n - 1) % 1000000007;
      auto fin1 = lawej(1, 0, n - 1, l, besti, 0) % 1000000007;
      auto fin2 = lawej(1, 0, n - 1, besti, r, 1) % 1000000007;
      fin1 = ((fin1 - ((fol % 1000000007 * kal % 1000000007) % 1000000007)) +
              1000000007) %
             1000000007;
      fin2 = ((fin2 - ((sol % 1000000007 * nal % 1000000007) % 1000000007)) +
              1000000007) %
             1000000007;
      cout << (fin1 + fin2) % 1000000007 << '\n';
    }
  }
  return 0;
}
