#include <bits/stdc++.h>
using namespace std;
const long long int N = 200009, mod = 1e9 + 7;
int n, q, a[N], low[4 * N], high[4 * N], leaf[N];
long long int b[N], w[N], aw[N], sw[4 * N], saw[4 * N], sb[4 * N];
void Built(int v, int l, int h) {
  low[v] = l;
  high[v] = h;
  if (l == h) {
    sw[v] = w[l];
    saw[v] = aw[l];
    leaf[l] = v;
    sb[v] = b[l];
  } else {
    long long int m = (l + h) / 2;
    Built(v * 2, l, m);
    Built(v * 2 + 1, m + 1, h);
    sw[v] = (sw[v * 2] + sw[v * 2 + 1]);
    saw[v] = (saw[v * 2] + saw[v * 2 + 1]);
    sb[v] = (sb[v * 2] + sb[v * 2 + 1]);
  }
}
long long int Next() {
  register char ch = getchar();
  bool neg = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') {
      neg = 1;
    }
    ch = getchar();
  }
  long long int l = 0;
  while (ch >= '0' && ch <= '9') {
    l = l * 10 + ch - '0';
    ch = getchar();
  }
  if (neg) {
    return -l;
  }
  return l;
}
void Inp() {
  n = Next();
  q = Next();
  for (int i = 1; i <= n; i++) {
    a[i] = Next();
  }
  for (int i = 1; i <= n; i++) {
    w[i] = Next();
    aw[i] = (w[i] * i) % mod;
    b[i] = (w[i] * a[i]) % mod;
  }
  Built(1, 1, n);
}
long long int Update(int k) {
  long long int v = leaf[k];
  sw[v] = w[k];
  saw[v] = aw[k];
  sb[v] = b[k];
  v = v / 2;
  while (v != 0) {
    sw[v] = (sw[v * 2] + sw[v * 2 + 1]);
    saw[v] = (saw[v * 2] + saw[v * 2 + 1]);
    sb[v] = (sb[v * 2] + sb[v * 2 + 1]);
    v = v / 2;
  }
}
long long int Sumw(int v, int l, int h) {
  if (low[v] > h || high[v] < l) {
    return 0;
  }
  if (low[v] >= l && high[v] <= h) {
    return sw[v];
  }
  return Sumw(v * 2, l, h) + Sumw(v * 2 + 1, l, h);
}
long long int Sumb(int v, int l, int h) {
  if (low[v] > h || high[v] < l) {
    return 0;
  }
  if (low[v] >= l && high[v] <= h) {
    return sb[v];
  }
  return (Sumb(v * 2, l, h) + Sumb(v * 2 + 1, l, h));
}
long long int Sumaw(int v, int l, int h) {
  if (low[v] > h || high[v] < l) {
    return 0;
  }
  if (low[v] >= l && high[v] <= h) {
    return saw[v];
  }
  return (Sumaw(v * 2, l, h) + Sumaw(v * 2 + 1, l, h));
}
long long int Tinhaw(int l, int r, int k) {
  return (Sumaw(1, l, r) + (k - l) * Sumw(1, l, r));
}
long long int Calc1(int l, int r, int k) {
  long long int cnt = (r - l + 1);
  return ((Sumw(1, l, r) % mod) * k - Sumb(1, l, r) + Tinhaw(l, r, 0));
}
long long int Calc2(int l, int r, int k, int ol) {
  if (r < l) {
    return 0;
  }
  return (-Sumb(1, l, r) + (Sumw(1, l, r) % mod) * k + Tinhaw(l, r, l - ol));
}
long long int Calc3(int l, int r, int k, int ol) {
  return (Sumb(1, l, r) - (Sumw(1, l, r) % mod) * k - Tinhaw(l, r, l - ol));
}
long long int Calc(int l, int r, int k) {
  int v = upper_bound(a + l, a + r + 1, k) - a - 1, low = v + 1, high = r;
  while (low <= high) {
    long long int mid = (low + high) / 2;
    if (a[mid] <= k + mid - l) {
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }
  return (Calc1(l, v, k) + Calc2(v + 1, high, k, l) +
          Calc3(high + 1, r, k, l)) %
         mod;
}
void Query(int p, int q) {
  int l = p, h = q;
  long long int s = Sumw(1, p, q);
  while (l <= h) {
    long long int m = (l + h) / 2;
    if (Sumw(1, p, m) <= s / 2) {
      l = m + 1;
    } else {
      h = m - 1;
    }
  }
  cout << (Calc(p, q, a[l] - (l - p)) + mod) % mod << '\n';
}
void Solve() {
  for (int i = 1; i <= q; i++) {
    int x, y;
    x = Next();
    y = Next();
    if (x < 0) {
      x = -x;
      w[x] = y;
      b[x] = (a[x] * w[x]) % mod;
      aw[x] = (w[x] * x) % mod;
      Update(x);
    } else {
      Query(x, y);
    }
  }
}
int main() {
  Inp();
  Solve();
}
