#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))

#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int MAX = 1 << 17;

int h[MAX], p[MAX], sorted[MAX], invSorted[MAX], prv[MAX], nxt[MAX], np[MAX];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	FOR(i, 0, n)
		cin >> h[i];
	FOR(i, 0, n)
	{
		cin >> p[i];
		p[i]--;
	}
	iota(sorted, sorted + n, 0);
	sort(sorted, sorted + n, [](int i, int j) {return h[i] < h[j];});
	FOR(i, 0, n)
		invSorted[sorted[i]] = i;
	LL lastans = 0, k = 0;
	FOR(i, 0, q + 1)
	{
		if (i != 0)
			cin >> k;
		k += lastans;
		FOR(j, 0, n)
		{
			np[j] = p[(j + k) % n];
		}
		FOR(j, 0, n)
			p[j] = np[j];
		lastans = 0;
		LL sum = 0;
		FOR(j, 0, n)
		{
			prv[sorted[j]] = j == 0 ? -1 : sorted[j - 1];
			nxt[sorted[j]] = j == n - 1 ? -1 : sorted[j + 1];
			if (j + 1 < n)
			{
				LL d = h[sorted[j + 1]] - h[sorted[j]];
				sum += d * d;
			}
		}
		RFOR(j, n, 0)
		{
			lastans += sum;
			int pos = invSorted[np[j]];
			int l = prv[pos];
			int r = nxt[pos]; 
			if (l != -1)
			{
				LL d = h[sorted[pos]] - h[sorted[l]];
				sum -= d * d;
				nxt[l] = r;
			}
			if (r != -1) 
			{
				LL d = h[sorted[pos]] - h[sorted[r]];
				sum -= d * d;
				prv[r] = l;
			}
			if (l != -1 && r != -1)
			{
				LL d = h[sorted[l]] - h[sorted[r]];
				sum += d * d;
			}
		}
		cout << lastans << "\n";
	}
}