Problem: There is an infinite line consisting of cells. There are n boxes in some cells of this line. The i-th box stands in the cell a_i and has weight w_i. All a_i are distinct, moreover, a_{i - 1} < a_i holds for all valid i.

You would like to put together some boxes. Putting together boxes with indices in the segment [l, r] means that you will move some of them in such a way that their positions will form some segment [x, x + (r - l)].

In one step you can move any box to a neighboring cell if it isn't occupied by another box (i.e. you can choose i and change a_i by 1, all positions should remain distinct). You spend w_i units of energy moving the box i by one cell. You can move any box any number of times, in arbitrary order.

Sometimes weights of some boxes change, so you have queries of two types: 

  1. id nw — weight w_{id} of the box id becomes nw. 
  2. l r — you should compute the minimum total energy needed to put together boxes with indices in [l, r]. Since the answer can be rather big, print the remainder it gives when divided by 1000 000 007 = 10^9 + 7. Note that the boxes are not moved during the query, you only should compute the answer. 



Note that you should minimize the answer, not its remainder modulo 10^9 + 7. So if you have two possible answers 2 ⋅ 10^9 + 13 and 2 ⋅ 10^9 + 14, you should choose the first one and print 10^9 + 6, even though the remainder of the second answer is 0.

Input

The first line contains two integers n and q (1 ≤ n, q ≤ 2 ⋅ 10^5) — the number of boxes and the number of queries.

The second line contains n integers a_1, a_2, ... a_n (1 ≤ a_i ≤ 10^9) — the positions of the boxes. All a_i are distinct, a_{i - 1} < a_i holds for all valid i.

The third line contains n integers w_1, w_2, ... w_n (1 ≤ w_i ≤ 10^9) — the initial weights of the boxes.

Next q lines describe queries, one query per line.

Each query is described in a single line, containing two integers x and y. If x < 0, then this query is of the first type, where id = -x, nw = y (1 ≤ id ≤ n, 1 ≤ nw ≤ 10^9). If x > 0, then the query is of the second type, where l = x and r = y (1 ≤ l_j ≤ r_j ≤ n). x can not be equal to 0.

Output

For each query of the second type print the answer on a separate line. Since answer can be large, print the remainder it gives when divided by 1000 000 007 = 10^9 + 7.

Example

Input

5 8
1 2 6 7 10
1 1 1 1 2
1 1
1 5
1 3
3 5
-3 5
-1 10
1 4
2 5


Output

0
10
3
4
18
7

Note

Let's go through queries of the example: 

  1. 1\ 1 — there is only one box so we don't need to move anything. 
  2. 1\ 5 — we can move boxes to segment [4, 8]: 1 ⋅ |1 - 4| + 1 ⋅ |2 - 5| + 1 ⋅ |6 - 6| + 1 ⋅ |7 - 7| + 2 ⋅ |10 - 8| = 10. 
  3. 1\ 3 — we can move boxes to segment [1, 3]. 
  4. 3\ 5 — we can move boxes to segment [7, 9]. 
  5. -3\ 5 — w_3 is changed from 1 to 5. 
  6. -1\ 10 — w_1 is changed from 1 to 10. The weights are now equal to w = [10, 1, 5, 1, 2]. 
  7. 1\ 4 — we can move boxes to segment [1, 4]. 
  8. 2\ 5 — we can move boxes to segment [5, 8]. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 2e5 + 7;
int n, q, a[maxn], w[maxn];
struct Fenwick1 {
  long long bs[maxn];
  void add(int x, long long y) {
    for (; x <= n; x += x & -x) bs[x] += y;
  }
  long long sum(int x) {
    long long s = 0;
    for (; x >= 1; x -= x & -x) s += bs[x];
    return s;
  }
} B0;
struct Fenwick {
  int bs[maxn];
  void add(int x, int y) {
    for (; x <= n; x += x & -x) (bs[x] += y) %= mod;
  }
  long long sum(int x) {
    int s = 0;
    for (; x >= 1; x -= x & -x) (s += bs[x]) %= mod;
    return s;
  }
} B1;
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i), a[i] -= i;
  for (int i = 1; i <= n; ++i) scanf("%d", w + i);
  for (int i = 1; i <= n; ++i)
    B0.add(i, w[i]), B1.add(i, w[i] * 1ll * a[i] % mod);
  while (q--) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (x < 0) {
      x = -x;
      int dt = y - w[x];
      w[x] = y;
      B0.add(x, dt);
      B1.add(x, dt * 1ll * a[x] % mod);
    } else {
      long long sl = B0.sum(x - 1), su = B0.sum(y) - sl;
      su = (su + 1) / 2;
      int l = x, r = y;
      while (l < r) {
        int m = (l + r) >> 1;
        if (B0.sum(m) - sl >= su)
          r = m;
        else
          l = m + 1;
      }
      int m = l;
      long long ans = (B1.sum(y) - B1.sum(m)) -
                      (B0.sum(y) - B0.sum(m)) % mod * 1ll * (a[m]) % mod -
                      (B1.sum(m) - B1.sum(x - 1)) +
                      (B0.sum(m) - B0.sum(x - 1)) % mod * (a[m]) % mod;
      ans = (ans % mod + mod) % mod;
      printf("%d\n", int(ans));
    }
  }
}