#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
  bool done_something = false;
  stringstream res;
  res << "[";
  for (; begin_iter != end_iter and counter; ++begin_iter) {
    done_something = true;
    counter--;
    res << *begin_iter << ", ";
  }
  string str = res.str();
  if (done_something) {
    str.pop_back();
    str.pop_back();
  }
  str += "]";
  return str;
}
vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
  vector<int> ord(size);
  for (int i = 0; i < size; i++) ord[i] = i;
  sort(ord.begin(), ord.end(), compare);
  return ord;
}
template <typename T>
bool MinPlace(T& a, const T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool MaxPlace(T& a, const T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename Container>
int SZ(const Container& S) {
  return S.size();
}
template <typename S, typename T>
ostream& operator<<(ostream& out, const pair<S, T>& p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}
template <typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  for (int i = 0; i < (int)v.size(); i++) {
    out << v[i];
    if (i != (int)v.size() - 1) out << ", ";
  }
  out << "]";
  return out;
}
using namespace std;
template <typename Value>
class Fenwick {
 public:
  Fenwick(int N) : size(N), max_pow2(log2(N)), container(N, 0) {}
  Fenwick(const vector<Value>& initial_values)
      : Fenwick(initial_values.size()) {
    for (int p = 0; p < size; p++) {
      int q = p | (p + 1);
      container[p] += initial_values[p];
      if (q < size) container[q] += container[p];
    }
  }
  void Add(int p, Value x) {
    for (; p < size; p |= (p + 1)) container[p] += x;
  }
  Value GetRange(int l, int r) {
    if (l > 0) return GetRange(0, r) - GetRange(0, l - 1);
    Value res = 0;
    for (; r >= 0; r = (r & (r + 1)) - 1) res += container[r];
    return res;
  }

 private:
  int size;
  int max_pow2;
  vector<Value> container;
};
const long long mod = 1e9 + 7;
template <typename Value>
class FenwickMod {
 public:
  FenwickMod(int N) : size(N), max_pow2(log2(N)), container(N, 0) {}
  FenwickMod(const vector<Value>& initial_values)
      : FenwickMod(initial_values.size()) {
    for (int p = 0; p < size; p++) {
      int q = p | (p + 1);
      container[p] += initial_values[p];
      container[p] %= mod;
      if (q < size) {
        container[q] += container[p];
        container[q] %= mod;
      }
    }
  }
  void Add(int p, Value x) {
    for (; p < size; p |= (p + 1)) {
      container[p] += x;
      container[p] %= mod;
    }
  }
  Value GetRange(int l, int r) {
    if (l > 0) return (GetRange(0, r) - GetRange(0, l - 1)) % mod;
    Value res = 0;
    for (; r >= 0; r = (r & (r + 1)) - 1) res += container[r];
    res %= mod;
    return res;
  }

 private:
  int size;
  int max_pow2;
  vector<Value> container;
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N, Q;
  cin >> N >> Q;
  vector<long long> A(N + 10, 0), W(N + 10, 0), AW(N + 10, 0);
  for (int i = 1; i <= N; i++) cin >> A[i], A[i] -= i;
  for (int i = 1; i <= N; i++) cin >> W[i];
  for (int i = 1; i <= N; i++) AW[i] = A[i] * W[i] % mod;
  Fenwick<long long> fenw(W);
  FenwickMod<long long> fenaw(AW);
  for (int q = 0; q < Q; q++) {
    int x, y;
    cin >> x >> y;
    if (x < 0) {
      x = -x;
      fenw.Add(x, y - W[x]);
      fenaw.Add(x, (A[x] * y - A[x] * W[x]) % mod);
      W[x] = y;
    } else {
      int l = x, r = y;
      while (l < r) {
        int m = (l + r) / 2;
        if (fenw.GetRange(x, m) < fenw.GetRange(m + 1, y))
          l = m + 1;
        else
          r = m;
      }
      int m = l;
      l = x, r = y;
      long long res1 = A[m] * (fenw.GetRange(l, m) % mod) % mod;
      long long res2 = fenaw.GetRange(l, m);
      long long res3 = A[m] * (fenw.GetRange(m, r) % mod) % mod;
      long long res4 = fenaw.GetRange(m, r);
      long long res = res1 - res2 - res3 + res4;
      res %= mod;
      if (res < 0) res += mod;
      cout << res << "\n";
    }
  }
}
