//
// Created by liuhao on 2024/5/13.
//
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include<bits/stdc++.h>
using namespace std;
#define PII pair<int,int>
#define fi first
#define se second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define endl '\n'
#define vii vector<vector<int>>
char *p1, *p2, buf[100000];
#define getcar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)

inline int read() {
	int x = 0, f = 1, c = getcar();
	while (!(c<='9'&&c>='0')) f = (c == '-' ? -f : f), c = getcar();
	while (c<='9'&&c>='0') x = x * 10 + c - '0', c = getcar();
	return x * f;
}
struct Node{
	int l,r,data;
};
#define re read()
signed main() {
#ifdef Liuhao
	freopen("in.txt", "r", stdin);
#else
	ios;
#endif
	int n=re,q=re;
	vector<int>a(n + 2);
	vector<int>h(n + 2);
	vector<int>st(n+1);
	for(int i=1;i<=n;i++){
		h[i]=re;
	}
	for (int i = 1; i <= n; i++) {
		a[i]=re;
		st[a[i]]=h[i];
	}
	int last=0;
	int k=0;
	
	auto get=[&](int i){//第i次进入的学号
		return a[(i+k-1)%n+1];
	};
	auto cal=[&](int i,int j){
		return (i-j)*(i-j);
	};
	auto solve=[&](){
		vector<int>l(n+2);
		vector<int>r(n+2);
		for(int j=1;j<=n+1;j++)l[j]=j-1;
		for(int j=0;j<=n;j++)r[j]=j+1;
		int res=0;
		for(int i=2;i<=n;i++){
			res+=cal(st[i],st[i-1]);
		}
		int ans=res;
		for(int j=n;j>=1;j--){
			int now=get(j);
			int pre=l[now];
			int nex=r[now];
			if(pre!=0)res-=cal(st[now],st[pre]);
			if(nex!=n+1)res-=cal(st[now],st[nex]);
			if(pre!=0&&nex!=n+1)res+=cal(st[pre],st[nex]);
			ans+=res;
			l[r[now]]=l[now];
			r[l[now]]=r[now];
		}
		k+=ans;
		cout<<ans<<endl;
	};
	solve();
	for(int i=1;i<=q;i++){
		k+=re;
		k+=last;
		k%=n;
		solve();
	}
	return 0;
}