#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+1;
double s[N];
int n,m;ll k;
int a[N],p[N],u[N],tmp[N];
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
    while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++) a[i]=read();
	m=read();scanf("%lld",&k);
	for(int i=1;i<=n;i++) p[i]=i,u[i]=i;
	for(int i=1;i<=m;i++){
		int x=read();
		swap(p[x],p[x+1]);
	}
	while(k){
		if(k&1){
			for(int i=1;i<=n;i++) tmp[i]=u[p[i]];
			for(int i=1;i<=n;i++) u[i]=tmp[i];
		}	
		for(int i=1;i<=n;i++) tmp[i]=p[p[i]];
		for(int i=1;i<=n;i++) p[i]=tmp[i];
		k>>=1;
	}
	for(int i=1;i<=n;i++) s[i]=a[u[i]]-a[u[i]-1]+s[i-1];
	for(int i=1;i<=n;i++) printf("%.1lf\n",s[i]);
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T,class U> void outs(T a,U b){if((ll)(a)>=inf-100||(ll)(a)<=-inf+100)out(b);else out(a);}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
int main(){
    ll n;cin>>n;
    string s;cin>>s;
    vector<pair<string,string>> a,b;
    rep(bit,1<<n){
        string t,u;
        rep(i,n){
            if(bit>>i&1)t+=s[i];
            else u+=s[i];
        }
        a.eb(t,u);
    }
    rep(bit,1<<n){
        string t,u;
        rep(i,n){
            if(bit>>i&1)t+=s[n*2-1-i];
            else u+=s[n*2-1-i];
        }
        b.eb(t,u);
    }
    sort(all(a));
    sort(all(b));
    //outv(a);outv(b);
    ll ans=0;
    for(auto x:a){
        ans+=ub(b,x)-lb(b,x);
    }
    out(ans);
}