#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000 + 7;
const long long LL_INF = 1ll * INF * INF;
const int MAX_N = 300000 + 7;
template <typename T>
inline void addmod(T& a, const long long& b, const int& MOD = INF) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
int n, q;
int a[MAX_N], w[MAX_N];
class FenWickTree {
 public:
  void update(int x, int val) {
    for (int t = x; t < MAX_N; t += t & -t) {
      L[t] += val;
      addmod(sum_weight[t], 1ll * val * a[x]);
      addmod(sum_level[t], 1ll * val * x);
    }
    addmod(::w[x], val);
  }
  long long get(int x) {
    long long res = 0;
    for (int t = x; t > 0; t -= t & -t) {
      res += L[t];
    }
    return res;
  }
  int get_sum_weight(int x) {
    int res = 0;
    for (int t = x; t > 0; t -= t & -t) {
      addmod(res, sum_weight[t]);
    }
    return res;
  }
  int get_weight_range(int u, int v) {
    int res = get_sum_weight(v);
    addmod(res, -get_sum_weight(u - 1));
    return res;
  }
  int get_sum_level(int u, int v) {
    int res = 0;
    for (int t = v; t > 0; t -= t & -t) {
      addmod(res, sum_level[t]);
    }
    for (int t = u - 1; t > 0; t -= t & -t) {
      addmod(res, -sum_level[t]);
    }
    return res;
  }
  long long get_range(int u, int v) { return get(v) - get(u - 1); }

 private:
  static const int MAX_N = ::MAX_N;
  long long L[MAX_N];
  int sum_weight[MAX_N];
  int sum_level[MAX_N];
} fenwickTree;
int get_cost_left(int u, int v) {
  if (u > v) return 0;
  int res = (fenwickTree.get_weight_range(u, v) -
             fenwickTree.get_range(u, v) % INF * a[u]) %
            INF;
  addmod(res, (fenwickTree.get_range(u, v) * 1ll * u -
               fenwickTree.get_sum_level(u, v)));
  return res;
}
int get_cost_right(int u, int v) {
  if (u > v) return 0;
  int res = (fenwickTree.get_range(u, v) % INF * a[v] -
             fenwickTree.get_weight_range(u, v)) %
            INF;
  addmod(res, -((fenwickTree.get_range(u, v) * 1ll * v -
                 fenwickTree.get_sum_level(u, v))));
  return res;
}
int calc(int u, int v) {
  if (u == v) return 0;
  long long total_sum = fenwickTree.get_range(u, v);
  int lo = u, hi = v - 1, res = v;
  while (lo <= hi) {
    int mid = (lo + hi) >> 1;
    long long tmp = fenwickTree.get_range(u, mid);
    if (tmp >= total_sum - tmp) {
      res = mid;
      lo = mid + 1;
    } else
      hi = mid - 1;
  }
  int found = res;
  for (int j = -2; j <= 2; ++j) {
    int cur = res + j;
    if (cur >= u && cur <= v) {
      bool check = true;
      if (cur - 1 >= u)
        check &=
            fenwickTree.get_range(u, cur - 1) <= fenwickTree.get_range(cur, v);
      if (cur + 1 <= v)
        check &=
            fenwickTree.get_range(u, cur) >= fenwickTree.get_range(cur + 1, v);
      if (check) {
        found = cur;
      }
    }
  }
  return found;
}
int calc_cost(int u, int v) {
  if (u == v) return 0;
  int found = calc(u, v);
  int ans = get_cost_right(u, found);
  addmod(ans, get_cost_left(found, v));
  return ans;
}
void solve() {
  cin >> n >> q;
  for (int i = (1), _b = (n + 1); i < _b; ++i) cin >> a[i];
  for (int i = (1), _b = (n + 1); i < _b; ++i) {
    int tmp;
    cin >> tmp;
    fenwickTree.update(i, tmp);
    assert(w[i] == tmp);
  }
  while (q-- > 0) {
    int u, v;
    cin >> u >> v;
    if (u < 0) {
      u = -u;
      fenwickTree.update(u, v - w[u]);
    } else {
      cout << calc_cost(u, v) << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  const bool multiple_test = false;
  int test = 1;
  if (multiple_test) cin >> test;
  for (int i = 0; i < test; ++i) {
    solve();
  }
}
