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;
using i64 = long long;
const int N = 2e5 + 5, MOD = 1e9 + 7;
struct Nod {
  i64 sum, st, dr;
  int cnt;
};
Nod pom[N * 4];
i64 w[N], pos[N], aib[N];
i64 qval;
int ql, qr, qpos;
int n, q;
static inline int lsb(const int &x) { return x & -x; }
static void aib_update(int pos, i64 val) {
  for (; pos < N; pos += lsb(pos)) aib[pos] += val;
}
static i64 aib_query(int pos) {
  i64 ant = 0;
  for (; pos > 0; pos -= lsb(pos)) ant += aib[pos];
  return ant;
}
static int cbin(int l, int r) {
  i64 targ = (aib_query(r) - aib_query(l - 1) + 1) / 2 + aib_query(l - 1);
  i64 tsum = 0;
  int pos = 0;
  for (int msk = 1 << 20; msk > 0; msk /= 2)
    if (pos + msk < N && tsum + aib[pos + msk] < targ) {
      pos += msk;
      tsum += aib[pos];
    }
  return pos + 1;
}
static void update(int nod, int st, int dr) {
  if (st == dr) {
    pom[nod] = {qval, 0, 0, 1};
    return;
  }
  int mid = (st + dr) / 2;
  if (qpos <= mid)
    update(2 * nod, st, mid);
  else
    update(2 * nod + 1, mid + 1, dr);
  pom[nod].sum = (pom[2 * nod].sum + pom[2 * nod + 1].sum) % MOD;
  pom[nod].cnt = pom[2 * nod].cnt + pom[2 * nod + 1].cnt;
  pom[nod].st = pom[2 * nod].st + pom[2 * nod + 1].st;
  pom[nod].st +=
      (pos[mid + 1] - pos[st] - pom[2 * nod].cnt) * pom[2 * nod + 1].sum;
  pom[nod].dr = pom[2 * nod].dr + pom[2 * nod + 1].dr;
  pom[nod].dr += (pos[dr] - pos[mid] - pom[2 * nod + 1].cnt) * pom[2 * nod].sum;
  pom[nod].st %= MOD, pom[nod].dr %= MOD;
}
static Nod query(int nod, int st, int dr) {
  if (ql <= st && dr <= qr) return pom[nod];
  Nod me, l = {0, 0, 0, 0}, r = {0, 0, 0, 0};
  int mid = (st + dr) / 2, bl = max(ql, st), br = min(qr, dr);
  bool fl = false, fr = false;
  if (ql <= mid) {
    l = query(2 * nod, st, mid);
    fl = true;
  }
  if (mid < qr) {
    r = query(2 * nod + 1, mid + 1, dr);
    fr = true;
  }
  if (fl && !fr) return l;
  if (fr && !fl) return r;
  me.sum = l.sum + r.sum;
  me.cnt = l.cnt + r.cnt;
  me.st = (l.st + r.st) + r.sum * (pos[mid + 1] - pos[bl] - l.cnt);
  me.dr = (l.dr + r.dr) + l.sum * (pos[br] - pos[mid] - r.cnt);
  me.st %= MOD, me.dr %= MOD;
  return me;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  i64 a, b, ant;
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> pos[i];
  for (qpos = 1; qpos <= n; ++qpos) {
    cin >> w[qpos];
    qval = w[qpos];
    update(1, 1, n);
    aib_update(qpos, qval);
  }
  while (q--) {
    cin >> a >> b;
    if (a > 0) {
      int p = cbin(a, b);
      ql = a, qr = p;
      ant = query(1, 1, n).dr;
      ql = p, qr = b;
      ant += query(1, 1, n).st;
      cout << (ant % MOD + MOD) % MOD << '\n';
    } else {
      a *= -1;
      qpos = a;
      qval = b;
      aib_update(qpos, qval - w[qpos]);
      w[qpos] = qval;
      update(1, 1, n);
    }
  }
  return 0;
}
