#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll

int n,q;
int h[100005];
int cnt[10004];
int p[200005];

list<int>::iterator it[10004];
void solve() {
    cin>>n>>q;

    ll sum=0;
    for(int i=1;i<=n;i++) {
        cin>>h[i];
        cnt[h[i]]++;
    }
    for(int i=1;i<=n;i++) {
        cin>>p[i];
        p[i+n]=p[i];
    }

    ll lastans=0;
    list<int> q;
    ll tmp=0;
    ll g=-1;
    for(int i=1;i<=10000;i++) {
        if(cnt[i]) {
            q.push_back(i);
            it[i]=(--q.end());
            if(g==-1)g=i;
            else {
                sum+=(ll)(i-g)*(i-g);
                g=i;
            }
        }
    }
    
    for(int i=n+tmp;i>=1+tmp;i--) {
        lastans+=sum;
        cnt[h[p[i]]]--;
        if(cnt[h[p[i]]]==0) {
            auto now=it[h[p[i]]];
            if(next(now)!=q.end() && now!=q.begin()) {
                ll lst=*prev(now);
                ll nxt=*next(now);
                sum+=(nxt-lst)*(nxt-lst);
            }
            if(next(now)!=q.end()) {
                ll nxt=*next(now);
                ll nw=h[p[i]];
                sum-=(nxt-nw)*(nxt-nw);
            }
            if(now!=q.begin()) {
                ll lst=*prev(now);
                ll nw=h[p[i]];
                sum-=(nw-lst)*(nw-lst);
            }
            q.erase(it[h[p[i]]]);
        }
    }

    cout<<lastans<<'\n';
    for(int i=1;i<=::q;i++) {
        ll k; cin>>k;
        tmp=(tmp+lastans+k)%n;
        lastans=0;
        ll sum=0;
        for(int i=1;i<=n;i++) {
            cnt[h[i]]++;
        }
        list<int> q;
        ll g=-1;
        for(int i=1;i<=10000;i++) {
            if(cnt[i]) {
                q.push_back(i);
                it[i]=(--q.end());
                if(g==-1)g=i;
                else {
                    sum+=(ll)(i-g)*(i-g);
                    g=i;
                }
            }
        }

        for(int i=n+tmp;i>=1+tmp;i--) {
            lastans+=sum;
            cnt[h[p[i]]]--;
            if(cnt[h[p[i]]]==0) {
                auto now=it[h[p[i]]];
                if(next(now)!=q.end() && now!=q.begin()) {
                    ll lst=*prev(now);
                    ll nxt=*next(now);
                    sum+=(nxt-lst)*(nxt-lst);
                }
                if(next(now)!=q.end()) {
                    ll nxt=*next(now);
                    ll nw=h[p[i]];
                    sum-=(nxt-nw)*(nxt-nw);
                }
                if(now!=q.begin()) {
                    ll lst=*prev(now);
                    ll nw=h[p[i]];
                    sum-=(nw-lst)*(nw-lst);
                }
                q.erase(it[h[p[i]]]);
            }
        }
        cout<<lastans<<'\n';
    }
}
/*

*/

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int t=1;
    // cin>>t;
    while(t--)
    solve();
}