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;
const int Imx = 2147483647;
const long long Lbig = 2e18;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
const int maxn = 200111;
int n, q;
long long pos[maxn];
struct SGT {
  long long a[maxn << 4], b[maxn << 4];
  void modify(int x, long long v, int l, int r, int p) {
    if (l == r) {
      a[p] = v;
      b[p] = pos[l] * v % mod;
      return;
    }
    int m = l + r >> 1;
    if (x <= m)
      modify(x, v, l, m, p << 1);
    else
      modify(x, v, m + 1, r, p << 1 | 1);
    a[p] = a[p << 1] + a[p << 1 | 1];
    b[p] = (b[p << 1] + b[p << 1 | 1]) % mod;
  }
  long long query(int x, int y, int l, int r, int p) {
    if (x > y) return 0;
    if (x <= l && r <= y) return a[p];
    int m = l + r >> 1;
    long long ret = 0;
    if (x <= m) ret += query(x, y, l, m, p << 1);
    if (m < y) ret += query(x, y, m + 1, r, p << 1 | 1);
    return ret;
  }
  long long queryb(int x, int y, int l, int r, int p) {
    if (x > y) return 0;
    if (x <= l && r <= y) return b[p];
    int m = l + r >> 1;
    long long ret = 0;
    if (x <= m) ret += queryb(x, y, l, m, p << 1);
    if (m < y) ret += queryb(x, y, m + 1, r, p << 1 | 1);
    return ret % mod;
  }
  int querylft(int x, int y, long long &v, int l, int r, int p) {
    if (x <= l && r <= y) {
      if (v > a[p]) {
        v -= a[p];
        return r + 1;
      } else {
        if (l == r) return l;
        int m = l + r >> 1;
        if (v <= a[p << 1])
          return querylft(x, y, v, l, m, p << 1);
        else {
          v -= a[p << 1];
          return querylft(x, y, v, m + 1, r, p << 1 | 1);
        }
      }
    }
    int m = l + r >> 1;
    if (x <= m && m < y) {
      int t = querylft(x, y, v, l, m, p << 1);
      if (t == m + 1)
        return querylft(x, y, v, m + 1, r, p << 1 | 1);
      else
        return t;
    } else if (x <= m)
      return querylft(x, y, v, l, m, p << 1);
    else
      return querylft(x, y, v, m + 1, r, p << 1 | 1);
  }
} sgt;
long long w[maxn], w2[maxn];
long long solve(int l, int r) {
  long long sum = sgt.query(l, r, 1, n, 1);
  long long cur = (sum + 1) / 2;
  int p = sgt.querylft(l, r, cur, 1, n, 1);
  assert(p >= l && p <= r);
  long long ANS = sgt.queryb(p + 1, r, 1, n, 1) - sgt.queryb(l, p, 1, n, 1);
  long long cnt =
      (-sgt.query(p + 1, r, 1, n, 1) + sgt.query(l, p, 1, n, 1)) % mod;
  return ((ANS + cnt * pos[p] % mod) % mod + mod) % mod;
}
int main() {
  n = getnum(), q = getnum();
  for (int i = 1; i <= n; i++) {
    pos[i] = getnum();
    pos[i] -= i;
  }
  for (int i = 1; i <= n; i++) {
    w[i] = getnum();
    sgt.modify(i, w[i], 1, n, 1);
  }
  for (int i = 1; i <= q; i++) {
    long long x, y;
    x = getnum(), y = getnum();
    if (x > 0) {
      putnum(solve(x, y)), putchar('\n');
    } else {
      x = -x;
      w[x] = y;
      sgt.modify(x, y, 1, n, 1);
    }
  }
  return 0;
}
