#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
  x = 0;
  char c = getchar();
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  x *= f;
}
inline unsigned int R() {
  static unsigned int seed = 416;
  return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13;
}
const int N = 444444, mo = 1e9 + 7;
int n, q, a[N], w[N];
long long v1[N], v2[N], v3[N];
void add(int p, long long v) {
  v3[0] += v;
  while (p <= n) v3[p] += v, p += p & -p;
}
long long query(int p) {
  long long res = 0;
  while (p) res += v3[p], p -= p & -p;
  return res;
}
inline void add(long long *a, int p, long long v) {
  a[0] = (a[0] + v) % mo;
  while (p <= n) a[p] = (a[p] + v) % mo, p += p & -p;
}
inline long long query(long long *a, int p) {
  long long res = 0;
  while (p) res += a[p], p -= p & -p;
  return res % mo;
}
long long getval(long long *a, int l, int r) {
  l = max(l, 1);
  r = min(r, n);
  if (l > r) return 0;
  if (l == 1) return query(a, r);
  return (a[0] - query(a, l - 1) + mo) % mo;
}
long long getans(int x, int p) {
  return (query(v1, x) + 1LL * query(v2, x) * (a[p] - p)) % mo;
}
int main() {
  read(n);
  read(q);
  for (register int i = 1; i <= n; i++) read(a[i]);
  for (register int i = 1; i <= n; i++)
    read(w[i]), add(v1, i, 1LL * (i - a[i]) * w[i] % mo), add(v2, i, w[i]),
        add(i, w[i]);
  while (q--) {
    int u, v;
    read(u);
    read(v);
    if (u < 0) {
      u = -u;
      add(v1, u, 1LL * (u - a[u]) * (v - w[u] + mo) % mo);
      add(v2, u, v - w[u]);
      add(u, v - w[u]);
      w[u] = v;
    } else {
      int l = u, r = v, p = l, L = l, R = r;
      while (L <= R) {
        int mid = (L + R) >> 1;
        long long x = query(mid) - query(l - 1) - (query(r) - query(mid));
        if (x == 0) {
          p = mid;
          break;
        }
        if (x < 0) p = mid;
        if (x > 0)
          R = mid - 1;
        else
          L = mid + 1;
      }
      if (p + 1 <= r && query(p) - query(l - 1) < query(r) - query(p)) p++;
      long long res =
          getans(p - 1, p) - getans(l - 1, p) - (getans(r, p) - getans(p, p));
      printf("%lld\n", (res % mo + mo) % mo);
    }
  }
  return 0;
}
