#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long N, Q;
long long pos[200005], W[200005];
struct segtree {
  long long sum[800005], sumL[800005], sumR[800005];
  long long upd_pos, ql, qr, type;
  long long val, res;
  void build(long long n, long long l, long long r) {
    if (l == r) {
      sum[n] = W[l];
      sumL[n] = W[l] * (pos[l] + (N - l + 1)) % MOD;
      sumR[n] = W[l] * (pos[l] - l) % MOD;
      return;
    }
    long long mid = (l + r) >> 1;
    build((n << 1), l, mid);
    build((n << 1 | 1), mid + 1, r);
    sum[n] = sum[(n << 1)] + sum[(n << 1 | 1)];
    sumL[n] = sumL[(n << 1)] + sumL[(n << 1 | 1)] % MOD;
    sumR[n] = sumR[(n << 1)] + sumR[(n << 1 | 1)] % MOD;
  }
  void build() { build(1, 1, N); }
  void update(long long n, long long l, long long r) {
    if (l == r) {
      sum[n] = val;
      sumL[n] = val * (pos[l] + (N - l + 1)) % MOD;
      sumR[n] = val * (pos[l] - l) % MOD;
      return;
    }
    long long mid = (l + r) >> 1;
    if (upd_pos <= mid)
      update((n << 1), l, mid);
    else
      update((n << 1 | 1), mid + 1, r);
    sum[n] = sum[(n << 1)] + sum[(n << 1 | 1)];
    sumL[n] = sumL[(n << 1)] + sumL[(n << 1 | 1)] % MOD;
    sumR[n] = sumR[(n << 1)] + sumR[(n << 1 | 1)] % MOD;
  }
  void update(long long pos, long long new_val) {
    upd_pos = pos;
    val = new_val;
    update(1, 1, N);
  }
  void get_sum(long long n, long long l, long long r) {
    if (ql <= l && r <= qr) {
      res += (type == 1 ? sum[n] : type == 2 ? sumL[n] : sumR[n]);
      return;
    }
    long long mid = (l + r) >> 1;
    if (ql <= mid) get_sum((n << 1), l, mid);
    if (qr > mid) get_sum((n << 1 | 1), mid + 1, r);
  }
  long long query(long long l, long long r, long long query_type) {
    if (l > r) return 0;
    ql = l, qr = r;
    type = query_type;
    res = 0;
    get_sum(1, 1, N);
    if (type == 1)
      return res;
    else
      return res % MOD;
  }
  long long K;
  void binser(long long n, long long l, long long r) {
    if (K < 0) return;
    if (l == r) {
      if (K < sum[n]) {
        res = l;
        K = -1;
      } else {
        K -= sum[n];
      }
      return;
    }
    long long mid = (l + r) >> 1;
    if (ql <= l && r <= qr) {
      if (sum[n] <= K) {
        K -= sum[n];
        return;
      }
      if (K < sum[(n << 1)]) {
        binser((n << 1), l, mid);
      } else {
        K -= sum[(n << 1)];
        binser((n << 1 | 1), mid + 1, r);
      }
      return;
    }
    if (ql <= mid) binser((n << 1), l, mid);
    if (qr > mid) binser((n << 1 | 1), mid + 1, r);
  }
  long long cari(long long l, long long r, long long sum) {
    K = sum >> 1;
    ql = l, qr = r;
    binser(1, 1, N);
    return res;
  }
};
segtree tree;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin >> N >> Q;
  for (long long i = 1; i <= N; i++) {
    cin >> pos[i];
  }
  for (long long i = 1; i <= N; i++) {
    cin >> W[i];
  }
  tree.build();
  long long x, y, mid;
  long long total_sum, sum_left, sum_right;
  while (Q--) {
    cin >> x >> y;
    if (x < 0) {
      tree.update(-x, y);
    } else {
      total_sum = tree.query(x, y, 1);
      mid = tree.cari(x, y, total_sum);
      sum_left =
          tree.query(x, mid - 1, 1) % MOD * (pos[mid] + (N - mid + 1)) % MOD -
          tree.query(x, mid - 1, 2);
      sum_right = tree.query(mid + 1, y, 3) -
                  tree.query(mid + 1, y, 1) % MOD * (pos[mid] - mid) % MOD;
      while (sum_left < 0) sum_left = sum_left + MOD;
      while (sum_right < 0) sum_right = sum_right + MOD;
      cout << (sum_left + sum_right) % MOD << "\n";
    }
  }
  cin >> N;
}
