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]. 
#include <bits/stdc++.h>
using namespace std;
long long sum1[300010 << 2], sum2[300010 << 2];
int a[300010], w[300010];
int n, q;
long long mod(long long a) {
  a %= 1000000007;
  if (a < 0) a += 1000000007;
  return a;
}
long long add(long long a, long long b) { return mod(a + b); }
long long mul(long long a, long long b) { return mod(a * b); }
void pushup1(int t) { sum1[t] = sum1[(t << 1)] + sum1[(t << 1 | 1)]; }
void pushup2(int t) { sum2[t] = add(sum2[(t << 1)], sum2[(t << 1 | 1)]); }
void modify1(int t, int l, int r, int pos, long long vl) {
  if (l == r) {
    sum1[t] = vl;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    modify1((t << 1), l, mid, pos, vl);
  else
    modify1((t << 1 | 1), mid + 1, r, pos, vl);
  pushup1(t);
}
void modify2(int t, int l, int r, int pos, long long vl) {
  if (l == r) {
    sum2[t] = vl;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    modify2((t << 1), l, mid, pos, vl);
  else
    modify2((t << 1 | 1), mid + 1, r, pos, vl);
  pushup2(t);
}
long long query1_sum(int t, int l, int r, int L, int R) {
  if (L <= l && r <= R) return sum1[t];
  int mid = (l + r) >> 1;
  if (R <= mid) return query1_sum((t << 1), l, mid, L, R);
  if (L > mid) return query1_sum((t << 1 | 1), mid + 1, r, L, R);
  return query1_sum((t << 1), l, mid, L, mid) +
         query1_sum((t << 1 | 1), mid + 1, r, mid + 1, R);
}
int query1_pos(int t, int l, int r, int L, int R, long long vl) {
  if (l == r) return l;
  int mid = (l + r) >> 1;
  if (R <= mid) return query1_pos((t << 1), l, mid, L, R, vl);
  if (L > mid) return query1_pos((t << 1 | 1), mid + 1, r, L, R, vl);
  long long suml = query1_sum((t << 1), l, mid, L, mid);
  if (suml >= vl)
    return query1_pos((t << 1), l, mid, L, mid, vl);
  else
    return query1_pos((t << 1 | 1), mid + 1, r, mid + 1, R, vl - suml);
}
long long query2_sum(int t, int l, int r, int L, int R) {
  if (L <= l && r <= R) return sum2[t];
  int mid = (l + r) >> 1;
  if (R <= mid) return query2_sum((t << 1), l, mid, L, R);
  if (L > mid) return query2_sum((t << 1 | 1), mid + 1, r, L, R);
  return add(query2_sum((t << 1), l, mid, L, mid),
             query2_sum((t << 1 | 1), mid + 1, r, mid + 1, R));
}
int main() {
  int i;
  int n, q;
  cin >> n >> q;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] -= i;
  }
  for (i = 1; i <= n; i++) cin >> w[i];
  for (i = 1; i <= n; i++) {
    modify1(1, 1, n, i, w[i]);
    modify2(1, 1, n, i, mul(a[i], w[i]));
  }
  while (q--) {
    int x, y;
    cin >> x >> y;
    if (x < 0) {
      x = -x;
      w[x] = y;
      modify1(1, 1, n, x, w[x]);
      modify2(1, 1, n, x, mul(a[x], w[x]));
    } else {
      long long sum = query1_sum(1, 1, n, x, y);
      int pos = query1_pos(1, 1, n, x, y, (sum + 1) >> 1);
      long long ans = 0;
      ans = add(ans, mul(a[pos], add(query1_sum(1, 1, n, x, pos),
                                     -query1_sum(1, 1, n, pos, y))));
      ans = add(ans,
                add(-query2_sum(1, 1, n, x, pos), query2_sum(1, 1, n, pos, y)));
      printf("%lld\n", ans);
    }
  }
  return 0;
}
