#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)

int n, x[100001], p[100000], d[100000], np[100000], tp[100000];
ll an[100001];

int main(){
	scanf("%d", &n);
	f(i, 1, n + 1)scanf("%d", x + i);
	f(i, 1, n)d[i] = x[i + 1] - x[i];
	f(i, 1, n)p[i] = i, np[i] = i;
	int m;
	ll k;
	scanf("%d%lld", &m, &k);
	f(i, 0, m){
		int t;
		scanf("%d", &t);
		swap(p[t - 1], p[t]);
	}
	while (k){
		if (k & 1){
			f(i, 1, n)tp[i] = np[p[i]];
			f(i, 1, n)np[i] = tp[i];
		}
		f(i, 1, n)tp[i] = p[p[i]];
		f(i, 1, n)p[i] = tp[i];
		k >>= 1;
	}
	an[1] = x[1];
	f(i, 2, n + 1)an[i] = an[i - 1] + d[np[i - 1]];
	f(i, 1, n + 1)printf("%lld\n", an[i]);
}
