#include<bits/stdc++.h>

using namespace std;

int P, N, M, x[100009], vv[100009], ans[100009], p[100009], ap[100009];
long long K;

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d", &N);
//M = 4, back (1);
//return 0;
for (int i=1; i<=N; i++)
    scanf ("%d", &x[i]), p[i] = i;
for (int i=N; i>=2; i--)
    x[i] -= x[i - 1];
scanf ("%d %lld", &M, &K);
for (int i=1; i<=M; i++)
{
    int j;
    scanf ("%d", &j);
    swap (p[j], p[j + 1]);
}
for (int i=1; i<=N; i++)
if (ap[i] == 0)
{
    int j = i, knt = 0;
    while (ap[j] == 0) ap[j] = 1, j = p[j], vv[knt ++] = j;
    int cat = K % knt;
    for (int p=0; p<knt; p++)
        ans[vv[p]] = vv[(p + cat) % knt];
}
long long curr = x[1];
printf ("%d.0\n", curr);
for (int i=2; i<=N; i++)
{
    curr += x[ans[i]];
    printf ("%lld.0\n", curr);
}

return 0;
}
