#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int ddx[] = {-1, -2, 1, -2, 2, -1, 2, 1}, ddy[] = {-2, -1, -2, 1, -1, 2, 1, 2};
long long a[200001], b[200001];
long long tree1[524288], tree2[524288];
void init(int node, int S, int E) {
  if (S == E) {
    tree1[node] = (a[S] * b[S]) % MOD;
    tree2[node] = b[S];
    return;
  }
  init(2 * node, S, (S + E) / 2);
  init(2 * node + 1, (S + E) / 2 + 1, E);
  tree1[node] = (tree1[node * 2] + tree1[node * 2 + 1]) % MOD;
  tree2[node] = tree2[node * 2] + tree2[node * 2 + 1];
}
void upd(int node, int S, int E, int k) {
  if (S == E) {
    tree1[node] = (a[S] * b[S]) % MOD;
    tree2[node] = b[S];
    return;
  }
  if (k <= (S + E) / 2)
    upd(node * 2, S, (S + E) / 2, k);
  else
    upd(node * 2 + 1, (S + E) / 2 + 1, E, k);
  tree1[node] = (tree1[node * 2] + tree1[node * 2 + 1]) % MOD;
  tree2[node] = tree2[node * 2] + tree2[node * 2 + 1];
}
pair<long long, long long> operator+(const pair<long long, long long> &p1,
                                     const pair<long long, long long> &p2) {
  return make_pair((p1.first + p2.first) % MOD, p1.second + p2.second);
}
pair<long long, long long> find(int node, int S, int E, int i, int j) {
  if (i > E || j < S) return {0, 0};
  if (i <= S && j >= E) return {tree1[node], tree2[node]};
  return find(node * 2, S, (S + E) / 2, i, j) +
         find(node * 2 + 1, (S + E) / 2 + 1, E, i, j);
}
int findK(int node, int S, int E, long long k) {
  if (S == E) return S;
  if (k <= tree2[node * 2]) return findK(node * 2, S, (S + E) / 2, k);
  return findK(node * 2 + 1, (S + E) / 2 + 1, E, k - tree2[node * 2]);
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  for (int(i) = (1); (i) <= (n); (i) += (1)) {
    scanf("%lld", a + i);
    a[i] -= i;
  }
  for (int(i) = (1); (i) <= (n); (i) += (1)) scanf("%lld", b + i);
  init(1, 1, n);
  while (q--) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (x > 0) {
      long long k = (find(1, 1, n, x, y).second + 1) / 2;
      int i = findK(1, 1, n, k + find(1, 1, n, 1, x - 1).second);
      pair<long long, long long> s1 = find(1, 1, n, x, i - 1),
                                 s2 = find(1, 1, n, i + 1, y);
      long long ans =
          ((s1.second * a[i] - s1.first) + (s2.first - s2.second * a[i])) % MOD;
      if (ans < 0) ans += MOD;
      printf("%lld\n", ans);
    } else {
      x = -x;
      b[x] = y;
      upd(1, 1, n, x);
    }
  }
}
