#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
template <class T>
inline void ckmin(T& a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void ckmax(T& a, T b) {
  if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
const int maxn = (1 << 20);
const int MOD = 1000000007;
template <typename base_type, base_type _MOD>
class IntMod {
 public:
  static const int INVERSE_CACHE_SIZE = (1 << 20);
  static base_type MOD;
  static void set_mod(base_type new_mod) { MOD = new_mod; }
  base_type n;
  IntMod(long long d = 0) { n = (d >= 0 ? d % MOD : (d % MOD + MOD) % MOD); }
  virtual ~IntMod() = default;
  IntMod operator-() const { return Build(n == 0 ? 0 : MOD - n); }
  IntMod& operator+=(IntMod a) {
    n = (n >= MOD - a.n ? n - MOD + a.n : n + a.n);
    return *this;
  }
  IntMod& operator-=(IntMod a) {
    n = (n >= a.n) ? n - a.n : n - a.n + MOD;
    return *this;
  }
  IntMod& operator*=(IntMod a) {
    *this = *this * a;
    return *this;
  }
  IntMod& operator/=(IntMod a) {
    *this = *this / a;
    return *this;
  }
  static IntMod build(base_type n) {
    IntMod r;
    r.n = n;
    return r;
  }
  static base_type inverse_cache[INVERSE_CACHE_SIZE];
  static bool inverse_cache_ready;
  friend IntMod inverse(IntMod n) { return build(inverse_internal(n.n)); }
  static base_type inverse_internal(base_type n) {
    if (!inverse_cache_ready) {
      inverse_cache_ready = true;
      inverse_cache[0] = 0;
      inverse_cache[1] = 1;
      for (int n = 2; n < INVERSE_CACHE_SIZE; ++n)
        inverse_cache[n] =
            (MOD -
             (base_type)((long long)inverse_cache[MOD % n] * (MOD / n) % MOD));
    }
    return n < INVERSE_CACHE_SIZE
               ? inverse_cache[n]
               : MOD - (base_type)((long long)inverse_internal(MOD % n) *
                                   (MOD / n) % MOD);
  }
  friend bool operator==(IntMod a, IntMod b) { return a.n == b.n; }
  friend bool operator!=(IntMod a, IntMod b) { return a.n != b.n; }
  friend IntMod operator+(IntMod a, IntMod b) {
    return build(a.n >= MOD - b.n ? a.n - MOD + b.n : a.n + b.n);
  }
  friend IntMod operator-(IntMod a, IntMod b) {
    return build(a.n >= b.n ? a.n - b.n : a.n - b.n + MOD);
  }
  friend IntMod operator*(IntMod a, IntMod b) {
    return build(
        static_cast<base_type>(static_cast<long long>(a.n) * b.n % MOD));
  }
  friend IntMod operator/(IntMod a, IntMod b) { return a * inverse(b); }
  friend IntMod pow(IntMod p, long long e) {
    if (e <= 0) return IntMod(1);
    IntMod r = IntMod(1);
    while (1) {
      if (e & 1) r *= p;
      e /= 2;
      if (e)
        p = p * p;
      else
        break;
    }
    return r;
  }
  friend istream& operator>>(istream& stream, IntMod& a) {
    stream >> a.n;
    return stream;
  }
  friend ostream& operator<<(ostream& stream, const IntMod& a) {
    stream << a.n;
    return stream;
  }
};
template <typename base_type, base_type _MOD>
base_type IntMod<base_type, _MOD>::inverse_cache[INVERSE_CACHE_SIZE];
template <typename base_type, base_type _MOD>
bool IntMod<base_type, _MOD>::inverse_cache_ready;
template <typename base_type, base_type _MOD>
base_type IntMod<base_type, _MOD>::MOD = _MOD;
using Int = IntMod<int, MOD>;
int n;
int a[maxn], w[maxn];
Int sw[maxn], swa[maxn];
void update_sa(Int s[], int p, Int delta) {
  for (++p; p <= n; p = (p | (p - 1)) + 1) s[p] += delta;
}
Int get_sa(Int s[], int p) {
  Int r = 0;
  for (; p > 0; p &= (p - 1)) r += s[p];
  return r;
}
Int calc(Int s[], int a, int b) {
  if (a > b) return 0;
  return get_sa(s, b + 1) - get_sa(s, a);
}
void update_weight(int id, int new_w) {
  Int delta = new_w - w[id];
  update_sa(sw, id, delta);
  update_sa(swa, id, delta * a[id]);
  w[id] = new_w;
}
int query(int s, int t) {
  int m = (s + t) / 2;
  Int ret = 0;
  ret += calc(sw, s, m) * a[m];
  ret -= calc(swa, s, m);
  ret += calc(swa, m + 1, t);
  ret -= calc(sw, m + 1, t) * a[m];
  return ret.n;
}
int main() {
  std::ios::sync_with_stdio(false);
  int nq;
  while (cin >> n >> nq) {
    for (int i = 0; i < (n); ++i) cin >> a[i];
    for (int i = 0; i < (n); ++i) cin >> w[i];
    for (int i = 0; i < (n); ++i) a[i] -= i;
    for (int i = 0; i < (n + 1); ++i) sw[i] = swa[i] = 0;
    for (int i = 0; i < (n); ++i) update_sa(sw, i, w[i]);
    for (int i = 0; i < (n); ++i)
      update_sa(swa, i, (long long)w[i] * a[i] % MOD);
    for (int cl = 0; cl < (nq); ++cl) {
      int x, y;
      cin >> x >> y;
      if (x < 0)
        update_weight(-x - 1, y);
      else {
        int r = query(x - 1, y - 1);
        printf("%d\n", r);
      }
    }
    break;
  }
  return 0;
}
