#include <bits/stdc++.h>
using namespace std;
const int N = 212345;
const int MOD = 1e9 + 7;
const int L = 1;
const int R = 1e9;
struct Tree {
  void Clear(int n, long long *base, bool mod) {
    n_ = n;
    mod_ = mod;
    memset(s_, 0, sizeof(s_));
    Build(base, 1, n, 1);
  }
  void Update(int rt) {
    s_[rt] = s_[rt << 1] + s_[rt << 1 | 1];
    if (mod_ && s_[rt] >= MOD) {
      s_[rt] -= MOD;
    }
  }
  void Build(long long *base, int l, int r, int rt) {
    if (l == r) {
      s_[rt] = base[l];
      assert(base[l] < MOD);
      return;
    }
    int m = l + r >> 1;
    Build(base, l, m, rt << 1);
    Build(base, m + 1, r, rt << 1 | 1);
    Update(rt);
  }
  long long RangeSum(int l, int r) { return RangeSum(l, r, 1, n_, 1); }
  long long RangeSum(int xl, int xr, int l, int r, int rt) {
    if (xl <= l && r <= xr) {
      return s_[rt];
    }
    long long sum = 0;
    int m = l + r >> 1;
    if (xl <= m) {
      sum += RangeSum(xl, xr, l, m, rt << 1);
    }
    if (m < xr) {
      sum += RangeSum(xl, xr, m + 1, r, rt << 1 | 1);
    }
    if (mod_ && sum >= MOD) {
      sum -= MOD;
    }
    return sum;
  }
  void SetValue(int x, long long v) { SetValue(x, v, 1, n_, 1); }
  void SetValue(int x, long long v, int l, int r, int rt) {
    if (l == r) {
      s_[rt] = v;
      return;
    }
    int m = l + r >> 1;
    if (x <= m) {
      SetValue(x, v, l, m, rt << 1);
    } else {
      SetValue(x, v, m + 1, r, rt << 1 | 1);
    }
    Update(rt);
  }
  int n_;
  long long s_[N << 2];
  bool mod_;
} sum_left, sum_right, sum_ori;
long long a[N], w[N];
long long wl[N], wr[N];
int Anchor(const int ml, const int mr, const long long sum) {
  int l = ml, r = mr;
  while (l != r) {
    int m = l + r >> 1;
    long long msum = sum_ori.RangeSum(ml, m);
    if (msum * 2 >= sum) {
      r = m;
    } else {
      l = m + 1;
    }
  }
  return l;
}
int GetLeft(int p, int r) {
  if (p >= r) {
    return 0;
  }
  long long lsum = sum_left.RangeSum(p + 1, r);
  long long dist = a[p] - (L + p - 1);
  long long sum = sum_ori.RangeSum(p + 1, r) % MOD;
  return (lsum - dist * sum % MOD + MOD) % MOD;
}
int GetRight(int l, int p, int n) {
  if (l >= p) {
    return 0;
  }
  long long rsum = sum_right.RangeSum(l, p - 1);
  long long dist = R - (n - p) - a[p];
  long long sum = sum_ori.RangeSum(l, p - 1) % MOD;
  return (rsum - dist * sum % MOD + MOD) % MOD;
}
int main() {
  int n, q;
  while (~scanf("%d%d", &n, &q)) {
    for (int i = 1; i <= n; ++i) scanf("%I64d", a + i);
    for (int i = 1; i <= n; ++i) scanf("%I64d", w + i);
    sum_ori.Clear(n, w, false);
    for (int i = 1; i <= n; ++i) {
      wl[i] = w[i] * (a[i] - (L + i - 1)) % MOD;
      wr[i] = w[i] * ((R - (n - i)) - a[i]) % MOD;
    }
    sum_left.Clear(n, wl, true);
    sum_right.Clear(n, wr, true);
    for (int i = 0; i < q; ++i) {
      long long l, r;
      scanf("%I64d%I64d", &l, &r);
      if (l < 0) {
        int x = -l;
        w[x] = r;
        sum_ori.SetValue(x, w[x]);
        wl[x] = w[x] * (a[x] - (L + x - 1)) % MOD;
        sum_left.SetValue(x, wl[x]);
        wr[x] = w[x] * ((R - (n - x)) - a[x]) % MOD;
        sum_right.SetValue(x, wr[x]);
      } else if (l > 0) {
        int len = r - l + 1;
        long long sum = sum_ori.RangeSum(l, r);
        int pivot = Anchor(l, r, sum);
        int ans = 0;
        ans += GetRight(l, pivot, n);
        ans += GetLeft(pivot, r);
        printf("%d\n", ans % MOD);
      } else {
        assert(false);
      }
    }
  }
  return 0;
}
