#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
template <typename T>
struct edge {
  int from, to;
  T w;
  edge(int from, int to, T w) : from(from), to(to), w(w) {}
  edge() {}
};
const long double EPS = 1e-9;
template <class T>
void show(T a) {
  for (auto x : a) cout << x << " ";
  cout << endl;
}
const int N = 2e5 + 1;
const int M = 1e9 + 7;
long double pw_double[N], pa_double[N];
long double tw_double[N], ta_double[N];
inline void upd_double(int i, long double w, long double a) {
  long double tmp = w;
  w -= pw_double[i];
  pw_double[i] = tmp;
  tmp = a;
  a -= pa_double[i];
  pa_double[i] = tmp;
  for (++i; i < N; i += i & -i) tw_double[i] += w, ta_double[i] += a;
}
inline void get_double(int l, int r, long double &w, long double &a) {
  if (l > r) return;
  for (++r; r > 0; r -= r & -r) w += tw_double[r], a += ta_double[r];
  for (; l > 0; l -= l & -l) w -= tw_double[l], a -= ta_double[l];
}
int pw[N], pa[N];
int tw[N], ta[N];
inline void upd(int i, int w, int a) {
  int tmp = w;
  w = ((w) - (pw[i]) < 0 ? (w) - (pw[i]) + M : (w) - (pw[i]));
  pw[i] = tmp;
  tmp = a;
  a = ((a) - (pa[i]) < 0 ? (a) - (pa[i]) + M : (a) - (pa[i]));
  pa[i] = tmp;
  for (++i; i < N; i += i & -i)
    tw[i] = ((tw[i]) + (w) >= M ? (tw[i]) + (w)-M : (tw[i]) + (w)),
    ta[i] = ((ta[i]) + (a) >= M ? (ta[i]) + (a)-M : (ta[i]) + (a));
}
inline void get(int l, int r, int &w, int &a) {
  if (l > r) return;
  for (++r; r > 0; r -= r & -r)
    w = ((w) + (tw[r]) >= M ? (w) + (tw[r]) - M : (w) + (tw[r])),
    a = ((a) + (ta[r]) >= M ? (a) + (ta[r]) - M : (a) + (ta[r]));
  for (; l > 0; l -= l & -l)
    w = ((w) - (tw[l]) < 0 ? (w) - (tw[l]) + M : (w) - (tw[l])),
    a = ((a) - (ta[l]) < 0 ? (a) - (ta[l]) + M : (a) - (ta[l]));
}
int a[N];
int n, q;
inline int bins(long long xl) {
  int l = -1, r = n;
  while (r - l > 1) {
    int m = (l + r) >> 1;
    if (xl + m - a[m] >= 0)
      l = m;
    else
      r = m;
  }
  return r;
}
inline long double get_double(int xx, int l, int r) {
  int pos = bins(xx - l);
  long double x = xx;
  long double w = 0, a = 0, w1 = 0, a1 = 0;
  get_double(l, min(pos - 1, r), w, a);
  get_double(max(l, pos), r, w1, a1);
  return (w - w1) * (x - l) + a - a1;
}
inline int get(int x, int l, int r) {
  int pos = bins(x - l);
  int w = 0, a = 0, w1 = 0, a1 = 0;
  get(l, min(pos - 1, r), w, a);
  get(max(l, pos), r, w1, a1);
  return ((((((long long)((w) - (w1) < 0 ? (w) - (w1) + M : (w) - (w1))) *
             (((x) - (l) < 0 ? (x) - (l) + M : (x) - (l)))) %
            M)) + (((a) - (a1) < 0 ? (a) - (a1) + M : (a) - (a1))) >=
                  M
              ? (((((long long)((w) - (w1) < 0 ? (w) - (w1) + M : (w) - (w1))) *
                   (((x) - (l) < 0 ? (x) - (l) + M : (x) - (l)))) %
                  M)) +
                    (((a) - (a1) < 0 ? (a) - (a1) + M : (a) - (a1))) - M
              : (((((long long)((w) - (w1) < 0 ? (w) - (w1) + M : (w) - (w1))) *
                   (((x) - (l) < 0 ? (x) - (l) + M : (x) - (l)))) %
                  M)) +
                    (((a) - (a1) < 0 ? (a) - (a1) + M : (a) - (a1))));
}
inline bool check(int x, int l, int r) {
  long double a = get_double(x, l, r), b = get_double(x + 1, l, r);
  return a > b || abs(a - b) < EPS;
}
int solve(int L, int R) {
  int l = -1, r = 1e9 + 9;
  while (r - l > 1) {
    int m = (l + r) >> 1;
    if (check(m, L, R))
      l = m;
    else
      r = m;
  }
  return get(r, L, R);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q;
  for (int i = 0; i < (int)(n); ++i) cin >> a[i];
  int w;
  for (int i = 0; i < (int)(n); ++i) {
    cin >> w;
    upd(i, w,
        ((((long long)w) *
          (((i) - (a[i]) < 0 ? (i) - (a[i]) + M : (i) - (a[i])))) %
         M));
    upd_double(i, w, (long double)w * (i - a[i]));
  }
  int x, y;
  while (q--) {
    cin >> x >> y;
    if (x < 0) {
      x = -x - 1;
      upd(x, y,
          ((((long long)y) *
            (((x) - (a[x]) < 0 ? (x) - (a[x]) + M : (x) - (a[x])))) %
           M));
      upd_double(x, y, (long double)y * (x - a[x]));
    } else {
      cout << solve(--x, --y) << "\n";
    }
  }
}
