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;
namespace Input {
const int BUF = 65536;
char buf[BUF + 1];
char *head = buf, *tail = buf;
inline char inputchar() {
  if (head == tail) *(tail = (head = buf) + fread(buf, 1, BUF, stdin)) = 0;
  return *head++;
}
inline void inputnum(int &ret) {
  char ch = inputchar();
  while (ch != '-' && (ch < '0' || ch > '9')) ch = inputchar();
  int sgn = (ch == '-' ? ch = inputchar(), -1 : 1);
  for (ret = 0; ch >= '0' && ch <= '9'; ch = inputchar())
    ret = ret * 10 + ch - '0';
  ret *= sgn;
}
}  // namespace Input
using Input::inputnum;
const int MAXN = 200005;
const int S = 450;
const int MOD = 1e9 + 7;
const int INF = 1 << 30;
inline void add(int &a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
inline void mul(int &a, int b) { a = (long long)a * b % MOD; }
struct Block {
  int sum, movel, mover, l, r;
} b[S + 10];
int a[MAXN], w[MAXN];
int n, q, x, y;
long long bit[MAXN];
inline int lowbit(int x) { return x & -x; }
inline void bit_add(int x, long long v) {
  ++x;
  for (int i = x; i <= n; i += lowbit(i)) bit[i] += v;
}
inline long long SUM(int x) {
  ++x;
  if (x <= 0) return 0;
  long long ret = 0;
  for (int i = x; i > 0; i ^= lowbit(i)) ret += bit[i];
  return ret;
}
int calc(int l, int r) {
  long long sum_d = SUM(l - 1), sum_u = SUM(r);
  while (l < r) {
    int mid = (l + r) >> 1;
    if (SUM(mid) - sum_d >= sum_u - SUM(mid))
      r = mid;
    else
      l = mid + 1;
  }
  return l;
}
int main() {
  inputnum(n), inputnum(q);
  for (int i = 0; i < n; i++) inputnum(a[i]);
  for (int i = 0; i < n; i++) inputnum(w[i]);
  for (int i = 0; i < n; i++) bit_add(i, w[i]);
  for (int i = 0; i < n; i++) add(b[i / S].sum, w[i]);
  for (int i = 0; i < n; i++) {
    int l = i, r = i, id = i / S;
    while (id == (r + 1) / S && r + 1 < n) ++r;
    for (int j = l; j <= r; j++)
      add(b[id].movel, (long long)(a[j] - a[l] - (j - l)) * w[j] % MOD);
    for (int j = r; j >= l; j--)
      add(b[id].mover, (long long)(a[r] - a[j] - (r - j)) * w[j] % MOD);
    b[id].l = l, b[id].r = r;
    i = r;
  }
  for (int i = 1; i <= q; i++) {
    inputnum(x), inputnum(y);
    if (x < 0) {
      x = -x;
      --x;
      int id = x / S, l = b[id].l, r = b[id].r;
      bit_add(x, y - w[x]);
      add(b[id].sum, (y - w[x] + MOD) % MOD);
      add(b[id].movel, MOD - (long long)(a[x] - a[l] - (x - l)) * w[x] % MOD);
      add(b[id].movel, (long long)(a[x] - a[l] - (x - l)) * y % MOD);
      add(b[id].mover, MOD - (long long)(a[r] - a[x] - (r - x)) * w[x] % MOD);
      add(b[id].mover, (long long)(a[r] - a[x] - (r - x)) * y % MOD);
      w[x] = y;
    } else {
      if (x == y) {
        printf("0\n");
        continue;
      }
      --x, --y;
      int L = x, R = y, M = calc(L, R);
      int idl = L / S, idm = M / S, idr = R / S, res = 0, d = max(L, b[idm].l),
          u = min(R, b[idm].r);
      for (int j = M - 1; j >= d; j--)
        add(res, (long long)(a[M] - a[j] - (M - j)) * w[j] % MOD);
      for (int j = M + 1; j <= u; j++)
        add(res, (long long)(a[j] - a[M] - (j - M)) * w[j] % MOD);
      for (int j = idm - 1; j > idl; j--) {
        int x = b[j].r;
        add(res, ((long long)((a[M] - M) - (a[x] - x)) * b[j].sum % MOD +
                  b[j].mover) %
                     MOD);
      }
      for (int j = idm + 1; j < idr; j++) {
        int x = b[j].l;
        add(res, ((long long)((a[x] - x) - (a[M] - M)) * b[j].sum % MOD +
                  b[j].movel) %
                     MOD);
      }
      if (idl != idm)
        for (int j = b[idl].r; j >= L; j--)
          add(res, (long long)((a[M] - M) - (a[j] - j)) * w[j] % MOD);
      if (idr != idm)
        for (int j = b[idr].l; j <= R; j++)
          add(res, (long long)((a[j] - j) - (a[M] - M)) * w[j] % MOD);
      printf("%d\n", res);
    }
  }
  return 0;
}
