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>
#pragma GCC optimize("O3")
using namespace std;
const int mod = 1000000007;
const double dancila = 3.14159265359;
const double eps = 1e-9;
int n, q;
int a[200002], w[200002];
struct seg {
  long long sum, costr, costl;
};
seg aint[800002];
void build(int nod, int st, int dr) {
  if (st == dr) {
    aint[nod].sum = w[st];
    if (st != 1) aint[nod].costr = 1LL * w[st] * (a[st] - a[st - 1] - 1);
    if (st != n) aint[nod].costl = 1LL * w[st] * (a[dr + 1] - a[dr] - 1);
    aint[nod].costr %= mod;
    aint[nod].costl %= mod;
    return;
  }
  int mid = (st + dr) / 2;
  build(nod << 1, st, mid);
  build(nod << 1 | 1, mid + 1, dr);
  aint[nod].sum = aint[nod << 1].sum + aint[nod << 1 | 1].sum;
  int lenB = dr - mid;
  int lenA = mid - st + 1;
  if (st != 1) {
    aint[nod].costr = aint[nod << 1].costr + aint[nod << 1 | 1].costr;
    aint[nod].costr += 1LL * (aint[nod << 1 | 1].sum % mod) *
                       ((a[mid] + 1) - (a[st - 1] + lenA) - 1);
  }
  if (dr != n) {
    aint[nod].costl = aint[nod << 1].costl + aint[nod << 1 | 1].costl;
    aint[nod].costl += 1LL * (aint[nod << 1].sum % mod) *
                       ((a[dr + 1] - lenB) - (a[mid + 1] - 1) - 1);
  }
  aint[nod].costr %= mod;
  aint[nod].costl %= mod;
}
void update(int nod, int st, int dr, int poz, int val) {
  if (st == dr) {
    w[st] = val;
    aint[nod].sum = w[st];
    if (st != 1) aint[nod].costr = 1LL * w[st] * (a[st] - a[st - 1] - 1);
    if (dr != n) aint[nod].costl = 1LL * w[st] * (a[dr + 1] - a[dr] - 1);
    aint[nod].sum %= mod;
    aint[nod].costr %= mod;
    aint[nod].costl %= mod;
    return;
  }
  int mid = (st + dr) / 2;
  if (poz <= mid)
    update(nod << 1, st, mid, poz, val);
  else
    update(nod << 1 | 1, mid + 1, dr, poz, val);
  aint[nod].sum = aint[nod << 1].sum + aint[nod << 1 | 1].sum;
  int lenB = dr - mid;
  int lenA = mid - st + 1;
  if (st != 1) {
    aint[nod].costr = aint[nod << 1].costr + aint[nod << 1 | 1].costr;
    aint[nod].costr += 1LL * (aint[nod << 1 | 1].sum % mod) *
                       ((a[mid] + 1) - (a[st - 1] + lenA) - 1);
  }
  if (dr != n) {
    aint[nod].costl = aint[nod << 1].costl + aint[nod << 1 | 1].costl;
    aint[nod].costl += 1LL * (aint[nod << 1].sum % mod) *
                       ((a[dr + 1] - lenB) - (a[mid + 1] - 1) - 1);
  }
  aint[nod].costr %= mod;
  aint[nod].costl %= mod;
}
long long query2(int nod, int st, int dr, int L, int R) {
  if (dr < L || st > R) return 0;
  if (L <= st && dr <= R) return aint[nod].sum;
  int mid = (st + dr) / 2;
  return query2(nod << 1, st, mid, L, R) +
         query2(nod << 1 | 1, mid + 1, dr, L, R);
}
seg query(int nod, int st, int dr, int L, int R) {
  if (L <= st && dr <= R) return aint[nod];
  int mid = (st + dr) / 2;
  seg ans = {0, 0, 0};
  if (mid >= L) {
    seg ans2 = query(nod << 1, st, mid, L, R);
    ans = ans2;
  }
  int lenA = mid - max(st, L) + 1;
  int lenB = min(dr, R) - mid;
  if (mid < R && mid >= L) {
    seg ans2 = query(nod << 1 | 1, mid + 1, dr, L, R);
    ans.costr += ans2.costr;
    ans.costr +=
        (ans2.sum % mod) * ((a[mid] + 1) - (a[max(L - 1, st - 1)] + lenA) - 1);
    ans.costl += ans2.costl;
    ans.costl +=
        (ans.sum % mod) * ((a[min(R, dr) + 1] - lenB) - (a[mid + 1] - 1) - 1);
    ans.costl %= mod;
    ans.costr %= mod;
    ans.sum += ans2.sum;
  } else if (mid < R) {
    seg ans2 = query(nod << 1 | 1, mid + 1, dr, L, R);
    ans = ans2;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) cin >> w[i];
  build(1, 1, n);
  for (; q; --q) {
    int poz;
    cin >> poz;
    if (poz < 0) {
      poz = -poz;
      int val;
      cin >> val;
      update(1, 1, n, poz, val);
    } else {
      int xd;
      cin >> xd;
      long long x = query2(1, 1, n, poz, xd);
      int st = poz;
      int dr = xd;
      int ans = -1;
      while (st <= dr) {
        int mid = (st + dr) / 2;
        long long y = query2(1, 1, n, poz, mid);
        if (y * 2 >= x)
          ans = mid, dr = mid - 1;
        else
          st = mid + 1;
      }
      seg y = {0, 0, 0};
      seg z = {0, 0, 0};
      if (ans > poz) y = query(1, 1, n, poz, ans - 1);
      if (ans < xd) z = query(1, 1, n, ans + 1, xd);
      cout << (y.costl + z.costr) % mod << '\n';
    }
  }
  return 0;
}
