#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
namespace Fread {
const int SIZE = 1 << 21;
char buf[SIZE], *S, *T;
inline char getchar() {
  if (S == T) {
    T = (S = buf) + fread(buf, 1, SIZE, stdin);
    if (S == T) return '\n';
  }
  return *S++;
}
}  // namespace Fread
namespace Fwrite {
const int SIZE = 1 << 21;
char buf[SIZE], *S = buf, *T = buf + SIZE;
inline void flush() {
  fwrite(buf, 1, S - buf, stdout);
  S = buf;
}
inline void putchar(char c) {
  *S++ = c;
  if (S == T) flush();
}
struct NTR {
  ~NTR() { flush(); }
} ztr;
}  // namespace Fwrite
namespace Fastio {
struct Reader {
  template <typename T>
  Reader& operator>>(T& x) {
    char c = Fread ::getchar();
    T f = 1;
    while (c < '0' || c > '9') {
      if (c == '-') f = -1;
      c = Fread ::getchar();
    }
    x = 0;
    while (c >= '0' && c <= '9') {
      x = x * 10 + (c - '0');
      c = Fread ::getchar();
    }
    x *= f;
    return *this;
  }
  Reader& operator>>(char& c) {
    c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    return *this;
  }
  Reader& operator>>(char* str) {
    int len = 0;
    char c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    while (c != '\n' && c != ' ') {
      str[len++] = c;
      c = Fread ::getchar();
    }
    str[len] = '\0';
    return *this;
  }
  Reader() {}
} cin;
const char endl = '\n';
struct Writer {
  template <typename T>
  Writer& operator<<(T x) {
    if (x == 0) {
      Fwrite ::putchar('0');
      return *this;
    }
    if (x < 0) {
      Fwrite ::putchar('-');
      x = -x;
    }
    static int sta[45];
    int top = 0;
    while (x) {
      sta[++top] = x % 10;
      x /= 10;
    }
    while (top) {
      Fwrite ::putchar(sta[top] + '0');
      --top;
    }
    return *this;
  }
  Writer& operator<<(char c) {
    Fwrite ::putchar(c);
    return *this;
  }
  Writer& operator<<(char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer& operator<<(const char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer() {}
} cout;
}  // namespace Fastio
const int MAXN = 2e5;
const int MOD = 1e9 + 7;
int n, q, a[MAXN + 5], w[MAXN + 5];
struct FenwickTree {
  __int128 sum[MAXN + 5];
  void point_add(int p, __int128 v) {
    for (int i = p; i <= n; i += (i & (-i))) {
      sum[i] += v;
    }
  }
  __int128 presum_query(int p) {
    __int128 res = 0;
    for (int i = p; i; i -= (i & (-i))) {
      res += sum[i];
    }
    return res;
  }
  __int128 range_sum_query(int l, int r) {
    if (l > r) {
      return 0;
    }
    return presum_query(r) - presum_query(l - 1);
  }
  FenwickTree() {}
};
FenwickTree T, T1, T2;
__int128 calc(int l, int r, int i) {
  return T1.range_sum_query(l, i - 1) * (a[i] - i) -
         T2.range_sum_query(l, i - 1) +
         T1.range_sum_query(i + 1, r) * (i - a[i]) +
         T2.range_sum_query(i + 1, r);
}
int main() {
  Fastio ::cin >> n >> q;
  for (int i = 1; i <= n; ++i) {
    Fastio ::cin >> a[i];
  }
  for (int i = 1; i <= n; ++i) {
    Fastio ::cin >> w[i];
    T1.point_add(i, w[i]);
    T2.point_add(i, (__int128)w[i] * (a[i] - i));
  }
  while (q--) {
    int x, y;
    Fastio ::cin >> x >> y;
    if (x < 0) {
      x = -x;
      __int128 d = (y - w[x]);
      T1.point_add(x, d);
      T2.point_add(x, d * (a[x] - x));
      w[x] = y;
    } else {
      int l = x, r = y;
      while (l < r) {
        int mid = (l + r) >> 1;
        if (T1.range_sum_query(x, mid) < T1.range_sum_query(mid + 1, y)) {
          l = mid + 1;
        } else {
          r = mid;
        }
      }
      __int128 ans = calc(x, y, l);
      if (l > x) {
        ckmin(ans, calc(x, y, l - 1));
      }
      Fastio ::cout << ans % MOD << Fastio ::endl;
    }
  }
  return 0;
}
