#include <bits/stdc++.h>
using namespace std;
int read() {
  int v = 0, f = 1;
  char c = getchar();
  while (c < 48 || 57 < c) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (48 <= c && c <= 57) v = (v << 3) + v + v + c - 48, c = getchar();
  return v * f;
}
const int N = 201000;
const long long MOD = 1e9 + 7;
int n, q;
long long t1[N << 2], t2[N << 2], a[N], t, w[N];
void modify(int u, int l, int r, int p, long long v) {
  if (l == r) {
    t1[u] = v;
    t2[u] = v * (a[p] - p) % MOD;
    return;
  }
  int mid = l + r >> 1;
  if (p <= mid)
    modify(u << 1, l, mid, p, v);
  else
    modify(u << 1 | 1, mid + 1, r, p, v);
  t1[u] = t1[u << 1] + t1[u << 1 | 1];
  t2[u] = (t2[u << 1] + t2[u << 1 | 1]) % MOD;
}
long long query(int u, int l, int r, int L, int R) {
  if (L > R) return 0;
  if (L <= l && r <= R) return t1[u];
  int mid = l + r >> 1;
  long long re = 0;
  if (L <= mid) re += query(u << 1, l, mid, L, R);
  if (mid < R) re += query(u << 1 | 1, mid + 1, r, L, R);
  return re;
}
long long query2(int u, int l, int r, int L, int R) {
  if (L > R) return 0;
  if (L <= l && r <= R) return t2[u];
  int mid = l + r >> 1;
  long long re = 0;
  if (L <= mid) re += query2(u << 1, l, mid, L, R);
  if (mid < R) re += query2(u << 1 | 1, mid + 1, r, L, R);
  return re % MOD;
}
int find2(int u, int l, int r) {
  if (l == r) return l;
  int mid = l + r >> 1;
  if (t - t1[u << 1] > 0) {
    t -= t1[u << 1];
    return find2(u << 1 | 1, mid + 1, r);
  } else {
    return find2(u << 1, l, mid);
  }
}
int find(int u, int l, int r, int L, int R) {
  if (L <= l && r <= R) {
    if (t - t1[u] > 0)
      t -= t1[u];
    else
      return find2(u, l, r);
    return 0;
  }
  int mid = l + r >> 1;
  if (L <= mid) {
    int tmp = find(u << 1, l, mid, L, R);
    if (tmp) return tmp;
  }
  if (mid < R) {
    int tmp = find(u << 1 | 1, mid + 1, r, L, R);
    if (tmp) return tmp;
  }
}
int main() {
  n = read(), q = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1; i <= n; i++) modify(1, 1, n, i, w[i]);
  while (q--) {
    int u = read(), v = read();
    if (u < 0) {
      u = -u;
      modify(1, 1, n, u, v);
    } else {
      t = query(1, 1, n, u, v);
      t = (t + 1) / 2;
      int p = find(1, 1, n, u, v);
      long long x = (a[p] - p) % MOD;
      printf("%lld\n", (query(1, 1, n, u, p) * x % MOD - query2(1, 1, n, u, p) -
                        query(1, 1, n, p + 1, v) * x % MOD +
                        query2(1, 1, n, p + 1, v) + MOD + MOD) %
                           MOD);
    }
  }
}
