#include <bits/stdc++.h>
using namespace std;
inline void addm(long long& a, const long long& b, const long long& mod) {
  a += b;
  while (a < 0) a += mod;
  while (a >= mod) a -= mod;
}
const long long mod = 1e9 + 7;
class fenwick_tree {
  long long mymod;
  int n;
  vector<long long> v;

 public:
  fenwick_tree(int _n, long long _mod)
      : n(_n), mymod(_mod), v(vector<long long>(n + 2, 0)) {}
  void add(int in, long long val) {
    for (; in < n; in = in | (in + 1)) addm(v[in], val, mymod);
  }
  long long sum(int r) {
    long long rval = 0;
    for (; r >= 0; r = (r & (r + 1)) - 1) addm(rval, v[r], mymod);
    return rval;
  }
  long long sum(int l, int r) {
    if (r < l) return 0;
    long long res = sum(r);
    addm(res, -(!l ? 0 : sum(l - 1)), mymod);
    return res;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  vector<long long> a(n), w(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  fenwick_tree sum(n, 1e18), wa(n, mod), wi(n, mod);
  for (int i = 0; i < n; i++) {
    cin >> w[i];
    sum.add(i, w[i]);
    wa.add(i, (a[i] * w[i]) % mod);
    wi.add(i, (i * 1ll * w[i]) % mod);
  }
  while (q--) {
    long long x, y;
    cin >> x >> y;
    if (x < 0) {
      x = -x - 1;
      sum.add(x, y - w[x]);
      wa.add(x, (((mod + y - w[x]) % mod) * a[x]) % mod);
      wi.add(x, (((mod + y - w[x]) % mod) * 1ll * x) % mod);
      w[x] = y;
    } else {
      long long s = sum.sum(--x, --y);
      int lo = x, hi = y;
      while (lo != hi) {
        int mid = (lo + hi) / 2 + 1;
        if (sum.sum(x, mid - 1) * 2 <= s)
          lo = mid;
        else
          hi = mid - 1;
      }
      long long sumwleft = sum.sum(x, lo) % mod;
      long long numleft = lo - x + 1;
      long long sumawleft = wa.sum(x, lo) % mod;
      long long sumwileft = wi.sum(x, lo) % mod;
      long long totalsumleft = (a[lo] * sumwleft) % mod - sumawleft -
                               (((sumwleft * lo) % mod) - sumwileft) % mod;
      addm(totalsumleft, 0, mod);
      long long sumwright = sum.sum(lo, y) % mod;
      long long numright = y - lo + 1;
      long long sumawright = wa.sum(lo, y) % mod;
      long long sumwiright = wi.sum(lo, y) % mod;
      long long totalsumright = sumawright - (a[lo] * sumwright) % mod -
                                (sumwiright - ((sumwright * lo) % mod)) % mod;
      addm(totalsumright, 0, mod);
      cout << (totalsumleft + totalsumright) % mod << "\n";
    }
  }
  return 0;
}
