#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const int mod = 1000000007;
long long a[maxn], w[maxn];
long long pos[maxn];
int n, q;
struct Bit {
  long long sum[maxn];
  int n;
  bool mod_flag;
  Bit(int n_) {
    n = n_;
    mod_flag = true;
    memset(sum, 0, sizeof sum);
  }
  void init(int n_, bool flag = true) {
    n = n_;
    mod_flag = flag;
  }
  void add(int x, long long val) {
    while (x <= n) {
      sum[x] += val;
      if (mod_flag) {
        if (sum[x] < 0) sum[x] += mod;
        if (sum[x] >= mod) sum[x] %= mod;
      }
      x += x & -x;
    }
  }
  long long get(int x) {
    long long res = 0;
    while (x) {
      res += sum[x];
      if (mod_flag) {
        if (res >= mod) res %= mod;
      }
      x -= x & -x;
    }
    return res;
  }
  long long query(int l, int r) {
    long long res = get(r) - get(l - 1);
    if (mod_flag) {
      res = (res + mod) % mod;
    }
    return res;
  }
};
Bit bit1(maxn), bit2(maxn), bit3(maxn);
int main() {
  cin >> n >> q;
  int m = 1e9;
  bit1.init(n, false);
  bit2.init(n);
  bit3.init(n);
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    cin >> w[i];
    pos[i] = m - (n - i);
    bit1.add(i, w[i]);
    bit2.add(i, w[i] * (a[i] - i));
    bit3.add(i, w[i] * (pos[i] - a[i]));
  }
  while (q--) {
    int x, y;
    cin >> x >> y;
    if (x < 0) {
      int id = -x;
      bit1.add(id, -w[id]);
      bit2.add(id, (a[id] - id) * (mod - w[id]));
      bit3.add(id, (pos[id] - a[id]) * (mod - w[id]));
      w[id] = y;
      bit1.add(id, w[id]);
      bit2.add(id, (a[id] - id) * w[id]);
      bit3.add(id, (pos[id] - a[id]) * w[id]);
    } else {
      long long res = bit1.get(y) - bit1.get(x - 1);
      long long middlesum = res / 2;
      int l = x, r = y, opt = -1;
      while (l <= r) {
        int m = (l + r) >> 1;
        if (bit1.get(m) - bit1.get(x - 1) > middlesum)
          r = m - 1, opt = m;
        else
          l = m + 1;
      }
      long long ans = 0;
      if (opt < y) {
        long long diff = a[opt] - opt;
        long long rsum = bit1.query(opt + 1, y);
        ans = (ans + bit2.query(opt + 1, y) - rsum * diff % mod + mod) % mod;
      }
      if (opt > x) {
        long long diff = pos[opt] - a[opt];
        long long lsum = bit1.query(x, opt - 1);
        ans = (ans + bit3.query(x, opt - 1) - lsum * diff % mod + mod) % mod;
      }
      cout << ans << endl;
    }
  }
  return 0;
}
