Problem: There are n squares drawn from left to right on the floor. The i-th square has three integers p_i,a_i,b_i, written on it. The sequence p_1,p_2,...,p_n forms a permutation.

Each round you will start from the leftmost square 1 and jump to the right. If you are now on the i-th square, you can do one of the following two operations:

  1. Jump to the i+1-th square and pay the cost a_i. If i=n, then you can end the round and pay the cost a_i. 
  2. Jump to the j-th square and pay the cost b_i, where j is the leftmost square that satisfies j > i, p_j > p_i. If there is no such j then you can end the round and pay the cost b_i. 



There are q rounds in the game. To make the game more difficult, you need to maintain a square set S (initially it is empty). You must pass through these squares during the round (other squares can also be passed through). The square set S for the i-th round is obtained by adding or removing a square from the square set for the (i-1)-th round. 

For each round find the minimum cost you should pay to end it.

Input

The first line contains two integers n, q (1≤ n,q≤ 2 ⋅ 10^5) — the number of squares and the number of rounds.

The second line contains n distinct integers p_1,p_2,...,p_n (1≤ p_i≤ n). It is guaranteed that the sequence p_1,p_2,...,p_n forms a permutation.

The third line contains n integers a_1,a_2,…,a_n (-10^9≤ a_i≤ 10^9).

The fourth line contains n integers b_1,b_2,...,b_n (-10^9≤ b_i≤ 10^9).

Then q lines follow, i-th of them contains a single integer x_i (1≤ x_i≤ n). If x_i was in the set S on the (i-1)-th round you should remove it, otherwise, you should add it.

Output

Print q lines, each of them should contain a single integer — the minimum cost you should pay to end the corresponding round.

Examples

Input


3 2
2 1 3
10 -5 4
3 -2 3
1
2


Output


6
8


Input


5 4
2 1 5 3 4
6 -5 3 -10 -1
0 3 2 7 2
1
2
3
2


Output


-8
-7
-7
-8

Note

Let's consider the character T as the end of a round. Then we can draw two graphs for the first and the second test.

<image> <image>

In the first round of the first test, the set that you must pass through is \{1\}. The path you can use is 1→ 3→ T and its cost is 6.

In the second round of the first test, the set that you must pass through is \{1,2\}. The path you can use is 1→ 2→ 3→ T and its cost is 8.

Solution (in CPP):

Solution:
//// just submit again for convinience
#include <bits/stdc++.h>
using namespace std;
#define int long long
void read (int &x) {
    char ch = getchar(); int f = 0; x = 0;
    while (!isdigit(ch)) { if (ch == '-') f = 1; ch = getchar(); }
    while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
    if (f) x = -x;
} const int N = 2e5 + 5;
int n, q, res, cnt[N], vis[N], p[N], a[N], b[N], fa[N][20], tp, t[N], sum[N], f[N], d[N];
set<int> s; set<int>::iterator it;
int lca(int x, int y) {
	if (d[x] < d[y]) swap(x, y);
	for (int i = 18; i >= 0; --i)
	  if (d[fa[x][i]] >= d[y]) x = fa[x][i];
	if (x == y)  return x;
	for (int i = 18; i >= 0; --i)
	  if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
	return fa[x][0];
}
int dis (int x, int y) {
    return f[x] + f[y] - 2 * f[lca (x, y)];
}
int add (int x) {
    it = s.insert(x).first; int l = *(--it); ++it, ++it;
    int r = it == s.end() ? *s.begin() : *it;
    res += dis (l, x) + dis (x, r) - dis (l, r);
}
void del (int x) {
    it = s.find (x); int l = *(--it); ++it, ++it;
    int r = it == s.end() ? *s.begin() : *it;
    res -= dis (l, x) + dis (x, r) - dis (l, r); s.erase (--it);
}
signed main() {
    read (n), read (q);
    for (int i = 1; i <= n; ++i) read (p[i]);
    for (int i = 1; i <= n; ++i) read (a[i]);
    for (int i = 1; i <= n; ++i) read (b[i]);
    for (int i = 1; i <= n; ++i) {
        while (tp && p[t[tp]] < p[i]) --tp;
        d[i] = d[fa[i][0] = t[tp]] + 1; t[++tp] = i;
        for (int j = 1; (1 << j) <= d[i]; ++j)
            fa[i][j] = fa[fa[i][j - 1]][j - 1];
    }
    for (int i = 1; i <= n; ++i)
        sum[i] = a[i] - b[i], sum[fa[i][0]] += b[i];
    for (int i = n; i >= 1; --i) 
        f[i] += sum[i], f[fa[i][0]] += min (f[i], 0ll), f[i] = max (f[i], 0ll);
    f[0] += sum[0]; for (int i = 1; i <= n; ++i) f[i] += f[fa[i][0]];
    ++cnt[0], s.insert (0);
    while (q--) {
        int x; read (x);
        if (vis[x]) {
            vis[x] = 0; if (!(--cnt[fa[x][0]])) del (fa[x][0]);
        } else {
            vis[x] = 1; if (!(cnt[fa[x][0]]++)) add (fa[x][0]);
        }
        printf ("%lld\n", res / 2 + f[0]);
    }
    return 0;
}