#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
template <class T>
inline void chkmin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline void chkmax(T &a, T b) {
  if (a < b) a = b;
}
const int MOD = 1e9 + 7;
const int MAXN = 1 << 18;
int a[MAXN];
long long w[MAXN + MAXN];
int wa[MAXN + MAXN];
void add(int &a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
int sum(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; }
int mul(long long a, long long b) { return (a * b) % (long long)MOD; }
void Init() {
  for (int i = MAXN - 1; i; --i) {
    wa[i] = sum(wa[2 * i], wa[2 * i + 1]);
    w[i] = w[2 * i] + w[2 * i + 1];
  }
}
void ChWA(int v, int d) {
  wa[v] = d;
  for (v /= 2; v; v /= 2) wa[v] = sum(wa[2 * v], wa[2 * v + 1]);
}
int GetWA(int v, int l, int r, int L, int R) {
  if (r <= L || R <= l) return 0;
  if (L <= l && r <= R) return wa[v];
  int m = (l + r) / 2;
  return sum(GetWA(2 * v, l, m, L, R), GetWA(2 * v + 1, m, r, L, R));
}
void ChW(int v, long long d) {
  w[v] = d;
  for (v /= 2; v; v /= 2) w[v] = w[2 * v] + w[2 * v + 1];
}
long long GetW(int v, int l, int r, int L, int R) {
  if (r <= L || R <= l) return 0;
  if (L <= l && r <= R) return w[v];
  int m = (l + r) / 2;
  return GetW(2 * v, l, m, L, R) + GetW(2 * v + 1, m, r, L, R);
}
int CalcRes(int i, int L, int R) {
  int res = mul(a[i], GetW(1, 0, MAXN, L, i) % (long long)MOD);
  add(res, -GetWA(1, 0, MAXN, L, i) + MOD);
  add(res, GetWA(1, 0, MAXN, i + 1, R));
  add(res, -mul(a[i], GetW(1, 0, MAXN, i + 1, R) % (long long)MOD) + MOD);
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    a[i] -= i;
  }
  for (int i = 0; i < n; ++i) {
    cin >> w[MAXN + i];
    wa[MAXN + i] = mul(a[i], w[MAXN + i]);
  }
  Init();
  for (int qq = 0; qq < q; ++qq) {
    int L;
    cin >> L;
    if (L > 0) {
      --L;
      int R;
      cin >> R;
      int l = L, r = R;
      while (r - l > 1) {
        int m = (l + r) / 2;
        if (GetW(1, 0, MAXN, L, m + 1) <= GetW(1, 0, MAXN, m + 1, R))
          l = m;
        else
          r = m;
      }
      if (GetW(1, 0, MAXN, L, r) < GetW(1, 0, MAXN, r, R))
        cout << CalcRes(r, L, R) << '\n';
      else
        cout << CalcRes(l, L, R) << '\n';
    } else {
      L = -L;
      --L;
      int nw;
      cin >> nw;
      ChW(MAXN + L, nw);
      ChWA(MAXN + L, mul(nw, a[L]));
    }
  }
}
