#include<iostream>
#include<cstdio>
#include<cstring>
namespace test
{
	typedef long long ll;
	const int N=100100;
	int n,m;
	template<typename T0,typename T1>void mul(T0 *a,T1 *b)
	{
		static T0 c[N];
		for(int i=1;i<=n;i++)
			c[i]=a[b[i]];
		for(int i=1;i<=n;i++)
			a[i]=c[i];
	}
	int a[N],c[N];
	ll f[N];
	ll ans,b;
	void initialize()
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
			scanf("%lld",f+i),a[i]=c[i]=i;
		ans=f[1];
		for(int i=1;i<n;i++)
			f[i]=f[i+1]-f[i];

		scanf("%d%lld",&m,&b);
		for(int i=1,x;i<=m;i++)
			scanf("%d",&x),std::swap(a[x-1],a[x]);
	}
	void qpow()
	{
		for(;b;b>>=1,mul(a,a))
			if(b&1)mul(c,a);
	}
	void solve()
	{
		initialize();
		qpow();
		mul(f,c);
		printf("%lld\n",ans);
		for(int i=1;i<n;i++)
			printf("%lld\n",ans+=f[i]);
	}
}
int main()
{
//	freopen("in","r",stdin);
//	freopen("out","w",stdout);
	test::solve();
	return 0;
}
