#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long i64;
const int MAX_N = 100005;
int N, M, A[MAX_N], P[MAX_N];
int res[MAX_N], temp[MAX_N];
i64 K, X[MAX_N], D[MAX_N];
void fpm(i64 x) {
for (int i = 1; i <= N; ++i) res[i] = i;
while (x) {
if (x & 1) {
for (int i = 1; i <= N; ++i)
//temp[i] = P[res[i]];
temp[i] = res[P[i]];
for (int i = 1; i <= N; ++i)
res[i] = temp[i];
}
for (int i = 1; i <= N; ++i) temp[i] = P[P[i]];
for (int i = 1; i <= N; ++i) P[i] = temp[i];
x >>= 1;
}
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%lld", &X[i]), D[i] = X[i] - X[i - 1];
for (int i = 1; i <= N; ++i)
P[i] = i;
scanf("%d%lld", &M, &K);
for (int i = 1; i <= M; ++i)
scanf("%d", &A[i]);
for (int i = M; i; --i) {
swap(P[A[i]], P[A[i] + 1]);
}
fpm(K);
for (int i = 1; i <= N; ++i)
temp[res[i]] = D[i];
for (int i = 2; i <= N; ++i)
X[i] = X[i - 1] + temp[i];
for (int i = 1; i <= N; ++i)
printf("%lld.0\n", X[i]);
return 0;
}