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>
using namespace std;
const int mod = 1e9 + 7;
int a[200005], w[200005];
long long pen[200005];
int add(int x, int y) { return ((x + y) % mod + mod) % mod; }
int mul(long long x, long long y) {
  x %= mod;
  y %= mod;
  return (long long)x * y % mod;
}
int mypow(int x, int c) {
  int ret = 1;
  while (c > 0) {
    if (c & 1) {
      ret = mul(ret, x);
    }
    c /= 2;
    x = mul(x, x);
  }
  return ret;
}
void update(int ind, long long ad) {
  while (ind < 200005) {
    pen[ind] += ad;
    ind += ind & (-ind);
  }
}
long long query(int ind) {
  long long ret = 0;
  while (ind > 0) {
    ret += pen[ind];
    ind = ind & (ind - 1);
  }
  return ret;
}
int seg[200005 * 4];
void init(int pos, int l, int r) {
  if (l == r) {
    seg[pos] = mul(a[l], w[l]);
    return;
  }
  int mid = (l + r) / 2;
  init(pos * 2, l, mid);
  init(pos * 2 + 1, mid + 1, r);
  seg[pos] = add(seg[pos * 2], seg[pos * 2 + 1]);
}
void update(int pos, int l, int r, int ind) {
  if (l == r) {
    assert(l == ind);
    seg[pos] = mul(a[l], w[l]);
    return;
  }
  int mid = (l + r) / 2;
  if (ind <= mid)
    update(pos * 2, l, mid, ind);
  else
    update(pos * 2 + 1, mid + 1, r, ind);
  seg[pos] = add(seg[pos * 2], seg[pos * 2 + 1]);
}
int query(int pos, int l, int r, int ql, int qr) {
  if (r < ql || qr < l) {
    return 0;
  }
  if (ql <= l && r <= qr) {
    return seg[pos];
  }
  int mid = (l + r) / 2;
  return add(query(pos * 2, l, mid, ql, qr),
             query(pos * 2 + 1, mid + 1, r, ql, qr));
}
long long sum(int x, int y) { return query(y) - query(x - 1); }
int pre[200005];
void solve() {
  int n, q;
  scanf("%d %d ", &n, &q);
  for (int i = 1; i <= n; ++i) {
    scanf("%d ", &a[i]);
    a[i] = a[i] - i;
    pre[i] = add(pre[i - 1], a[i]);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d ", &w[i]);
    update(i, w[i]);
  }
  init(1, 1, n);
  while (q--) {
    int x, y;
    scanf("%d %d ", &x, &y);
    if (x < 0) {
      int ind = -x;
      update(ind, -w[ind] + y);
      w[ind] = y;
      update(1, 1, n, ind);
    } else {
      if (y - x == 0) {
        printf("0\n");
      } else {
        int l = x, r = y, mid;
        long long total = sum(x, y);
        while (l < r) {
          mid = (l + r) / 2;
          if (sum(x, mid) * 2 > total) {
            r = mid;
          } else {
            l = mid + 1;
          }
        }
        assert(sum(x, l - 1) * 2 <= total);
        int ret = ret = add(mul(sum(x, l), a[l]), -query(1, 1, n, x, l));
        ret = add(ret, query(1, 1, n, l, y));
        ret = add(ret, -mul(sum(l, y), a[l]));
        printf("%d\n", ret);
      }
    }
  }
}
int main() {
  solve();
  return 0;
}