#include <bits/stdc++.h>
using namespace std;
const int N = 202020, P = 1e9 + 7;
int n, m;
int a[N], w[N];
int add(int a, int b) {
  if ((a += b) >= P) a -= P;
  return a;
}
int sub(int a, int b) {
  if ((a -= b) < 0) a += P;
  return a;
}
int mul(int a, int b) { return 1ll * a * b % P; }
struct Seg {
  static const int N = ::N << 2;
  long long sum[N];
  int num[N];
  vector<pair<pair<int, int>, int> > v;
  void up(int rt) {
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
    num[rt] = add(num[rt << 1], num[rt << 1 | 1]);
  }
  void build(int l, int r, int rt) {
    if (l == r) {
      sum[rt] = w[l];
      num[rt] = mul(w[l], sub(l, a[l]));
      return;
    }
    int mid = l + r >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    up(rt);
  }
  void upd(int p, int c, int l, int r, int rt) {
    if (l == r) {
      sum[rt] = w[l] = c;
      num[rt] = mul(c, sub(l, a[l]));
      return;
    }
    int mid = l + r >> 1;
    if (p <= mid)
      upd(p, c, l, mid, rt << 1);
    else
      upd(p, c, mid + 1, r, rt << 1 | 1);
    up(rt);
  }
  pair<int, int> qry2(int L, int R, int l, int r, int rt) {
    if (L > R) return make_pair(0, 0);
    if (L <= l && r <= R) return make_pair(num[rt], sum[rt] % P);
    int mid = l + r >> 1, res = 0, ans = 0;
    if (L <= mid) {
      auto u = qry2(L, R, l, mid, rt << 1);
      res = add(res, u.first);
      ans = add(ans, u.second);
    }
    if (R > mid) {
      auto u = qry2(L, R, mid + 1, r, rt << 1 | 1);
      res = add(res, u.first);
      ans = add(ans, u.second);
    }
    return make_pair(res, ans);
  }
  long long qry(int L, int R, int l, int r, int rt) {
    if (rt == 1) v.clear();
    if (L <= l && r <= R) {
      v.push_back(make_pair(make_pair(l, r), rt));
      return sum[rt];
    }
    int mid = l + r >> 1;
    long long res = 0;
    if (L <= mid) res += qry(L, R, l, mid, rt << 1);
    if (R > mid) res += qry(L, R, mid + 1, r, rt << 1 | 1);
    return res;
  }
  int qry(int L, int R) {
    long long c = qry(L, R, 1, n, 1), s = 0;
    for (auto u : v) {
      s += sum[u.second];
      if (s >= c - s) {
        s -= sum[u.second];
        int l = u.first.first, r = u.first.second, rt = u.second;
        while (l < r) {
          int mid = l + r >> 1;
          if (s + sum[rt << 1] >= c - s - sum[rt << 1]) {
            r = mid;
            rt = rt << 1;
          } else {
            s += sum[rt << 1];
            l = mid + 1;
            rt = rt << 1 | 1;
          }
        }
        return l;
      }
    }
  }
} seg;
int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  cin >> n >> m;
  for (int i = (1); i < (n + 1); ++i) cin >> a[i];
  for (int i = (1); i < (n + 1); ++i) cin >> w[i];
  seg.build(1, n, 1);
  while (m--) {
    int x, y;
    cin >> x >> y;
    if (x > 0) {
      int k = seg.qry(x, y);
      auto L = seg.qry2(x, k - 1, 1, n, 1);
      auto R = seg.qry2(k + 1, y, 1, n, 1);
      int ans = add(mul(sub(a[k], k), L.second), L.first);
      int res = sub(mul(sub(k, a[k]), R.second), R.first);
      cout << add(ans, res) << "\n";
    } else {
      seg.upd(-x, y, 1, n, 1);
    }
  }
  return 0;
}
