#include <bits/stdc++.h>
#pragma optimise("O3")
using namespace std;
mt19937 rnumber((long long)new char);
typedef struct Treap* Arbore;
Arbore NIL;
struct Treap {
  int move_st, move_dr;
  int poz, poz_min, poz_max, w, g;
  int prio;
  long long suma;
  Arbore st, dr;
  Treap(int g, int poz)
      : move_st(0),
        move_dr(0),
        poz(poz),
        poz_min(poz),
        poz_max(poz),
        suma(g),
        w(g),
        prio(rnumber()),
        st(NIL),
        dr(NIL),
        g(1) {}
  inline void recalc() {
    g = 1 + st->g + dr->g;
    suma = w + st->suma + dr->suma;
    poz_min = min(poz, st->poz_min);
    poz_max = max(poz, dr->poz_max);
    move_st =
        (1LL * (poz - poz_min - st->g) * w +
         1LL * (dr->poz_min - poz_min - st->g - 1) * (dr->suma % 1000000007) +
         st->move_st + dr->move_st) %
        1000000007;
    move_dr =
        (1LL * (poz_max - poz - dr->g) * w +
         1LL * (poz_max - st->poz_max - dr->g - 1) * (st->suma % 1000000007) +
         st->move_dr + dr->move_dr) %
        1000000007;
  }
};
Arbore join(Arbore a, Arbore b) {
  if (a == NIL) return b;
  if (b == NIL) return a;
  if (a->prio >= b->prio) {
    a->dr = join(a->dr, b);
    a->recalc();
    return a;
  }
  b->st = join(a, b->st);
  b->recalc();
  return b;
}
pair<Arbore, Arbore> split_by_number(Arbore a, int nr) {
  if (a == NIL) return {NIL, NIL};
  if (a->st->g >= nr) {
    pair<Arbore, Arbore> s = split_by_number(a->st, nr);
    a->st = NIL;
    a->recalc();
    return {s.first, join(s.second, a)};
  }
  pair<Arbore, Arbore> s = split_by_number(a->dr, nr - a->st->g - 1);
  a->dr = NIL;
  a->recalc();
  return {join(a, s.first), s.second};
}
pair<Arbore, Arbore> split_by_value(Arbore a, long long nr) {
  if (a == NIL) return {NIL, NIL};
  if (a->st->suma >= nr) {
    pair<Arbore, Arbore> s = split_by_value(a->st, nr);
    a->st = NIL;
    a->recalc();
    return {s.first, join(s.second, a)};
  }
  pair<Arbore, Arbore> s = split_by_value(a->dr, nr - a->st->suma - a->w);
  a->dr = NIL;
  a->recalc();
  return {join(a, s.first), s.second};
}
Arbore update(Arbore a, int poz, int w) {
  pair<Arbore, Arbore> s1 = split_by_number(a, poz);
  pair<Arbore, Arbore> s2 = split_by_number(s1.first, poz - 1);
  s2.second->w = w;
  s2.second->recalc();
  return join(s2.first, join(s2.second, s1.second));
}
inline Arbore query(Arbore a, int st, int dr) {
  pair<Arbore, Arbore> s1 = split_by_number(a, dr);
  pair<Arbore, Arbore> s2 = split_by_number(s1.first, st - 1);
  Arbore partea_st = s2.first, partea_dr = s1.second;
  a = s2.second;
  long long w = a->suma / 2;
  pair<Arbore, Arbore> s = split_by_value(a, w);
  long long ans = s.first->move_dr + s.second->move_st;
  if (s.first == NIL || s.second == NIL)
    ;
  else if (s.first->suma <= s.second->suma)
    ans += (s.second->poz_min - s.first->poz_max - 1) *
           (s.first->suma % 1000000007);
  else
    ans += (s.second->poz_min - s.first->poz_max - 1) *
           (s.second->suma % 1000000007);
  printf("%d\n", ans % 1000000007);
  return join(join(partea_st, s.first), join(s.second, partea_dr));
}
int main() {
  NIL = new Treap(0, 0);
  NIL->g = 0;
  NIL->poz_min = 1e9, NIL->poz_max = -1e9;
  Arbore k = NIL;
  int n, q;
  scanf("%d%d", &n, &q);
  vector<int> a(n), w(n);
  for (auto& i : a) scanf("%d", &i);
  for (auto& i : w) scanf("%d", &i);
  for (int i = 0; i < n; i++) k = join(k, new Treap(w[i], a[i]));
  while (q--) {
    int a, b;
    scanf("%d%d", &a, &b);
    if (a < 0)
      k = update(k, -a, b);
    else
      k = query(k, a, b);
  }
  return 0;
}
