#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
struct segT {
  int n;
  long long *seg;
  bool f;
  segT() {}
  segT(const vector<int> &v, bool f) : f(f) {
    n = v.size();
    seg = new long long[4 * N + 1];
    build(1, 0, n - 1, v);
  }
  void build(int r, int i, int j, const vector<int> &v) {
    if (i == j) {
      seg[r] = v[i];
    } else {
      int mid = (i + j) >> 1;
      build(2 * r, i, mid, v);
      build(2 * r + 1, mid + 1, j, v);
      seg[r] = seg[2 * r] + seg[2 * r + 1];
      if (f and seg[r] >= mod) seg[r] -= mod;
    }
  }
  int a, b;
  long long query(int r, int i, int j, long long val) {
    if (j < a or i > b) return 0;
    if (i >= a and j <= b) {
      if (val != -1) seg[r] = val;
      return seg[r];
    } else {
      int mid = (i + j) >> 1;
      long long L = query(2 * r, i, mid, val);
      long long R = query(2 * r + 1, mid + 1, j, val);
      if (f) {
        seg[r] = seg[2 * r] + seg[2 * r + 1];
        if (seg[r] >= mod) seg[r] -= mod;
        if (L + R >= mod) return L + R - mod;
        return L + R;
      } else {
        seg[r] = seg[2 * r] + seg[2 * r + 1];
        return L + R;
      }
    }
  }
  long long query(int l, int r) {
    a = l;
    b = r;
    return query(1, 0, n - 1, -1);
  }
  void update(int p, long long val) {
    a = b = p;
    query(1, 0, n - 1, val);
  }
} segw, segaw, segiw;
int n, q;
int a[N], w[N];
int get(int a, int b, long long l, long long beg) {
  long long ret = ((segw.query(a, b) % mod) * beg) % mod;
  ret = (ret + segiw.query(a, b));
  ret = (ret - segaw.query(a, b));
  ret = (ret - (segw.query(a, b) % mod) * l) % mod;
  return ret;
}
int go(int l, int r) {
  l--;
  r--;
  long long sum = segw.query(l, r);
  int bot = l, top = r;
  int center = 0;
  while (bot <= top) {
    int mid = (bot + top) >> 1;
    if (segw.query(l, mid) * 2LL >= sum) {
      center = mid;
      top = mid - 1;
    } else {
      bot = mid + 1;
    }
  }
  int beg = a[center] - (center - l);
  int L = get(l, center, l, beg);
  int R = -get(center + 1, r, l, beg);
  int ret = (L + R) % mod;
  if (ret < 0) ret += mod;
  return ret;
}
int main(void) {
  vector<int> vw, vaw, viw;
  scanf("%d %d", &n, &q);
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  for (int i = 0; i < n; i++) {
    scanf("%d", w + i);
    vw.push_back(w[i]);
    vaw.push_back((1LL * w[i] * a[i]) % mod);
    viw.push_back((1LL * w[i] * i) % mod);
  }
  segw = segT(vw, false);
  segaw = segT(vaw, true);
  segiw = segT(viw, true);
  while (q--) {
    int x, y;
    scanf("%d %d", &x, &y);
    if (x > 0) {
      printf("%d\n", go(x, y));
    } else {
      x *= -1;
      x--;
      segw.update(x, y);
      segaw.update(x, (1LL * a[x] * y) % mod);
      segiw.update(x, (1LL * y * x) % mod);
    }
  }
  return 0;
}
