There are N rabbits on a number line. The rabbits are conveniently numbered 1 through N. The coordinate of the initial position of rabbit i is x_i.

The rabbits will now take exercise on the number line, by performing sets described below. A set consists of M jumps. The j-th jump of a set is performed by rabbit a_j (2≤a_j≤N-1). For this jump, either rabbit a_j-1 or rabbit a_j+1 is chosen with equal probability (let the chosen rabbit be rabbit x), then rabbit a_j will jump to the symmetric point of its current position with respect to rabbit x.

The rabbits will perform K sets in succession. For each rabbit, find the expected value of the coordinate of its eventual position after K sets are performed.

Constraints

* 3≤N≤10^5
* x_i is an integer.
* |x_i|≤10^9
* 1≤M≤10^5
* 2≤a_j≤N-1
* 1≤K≤10^{18}

Input

The input is given from Standard Input in the following format:


N
x_1 x_2 ... x_N
M K
a_1 a_2 ... a_M


Output

Print N lines. The i-th line should contain the expected value of the coordinate of the eventual position of rabbit i after K sets are performed. The output is considered correct if the absolute or relative error is at most 10^{-9}.

Examples

Input

3
-1 0 2
1 1
2


Output

-1.0
1.0
2.0


Input

3
1 -1 1
2 2
2 2


Output

1.0
-1.0
1.0


Input

5
0 1 3 6 10
3 10
2 3 4


Output

0.0
3.0
7.0
8.0
10.0
import java.io.*;
import java.util.*;
public class Main
{
	
	private void solve()throws IOException
	{
		int n=nextInt();
		int x[]=new int[n+1];
		for(int i=1;i<=n;i++)
			x[i]=nextInt();
		int d[]=new int[n+1];
		for(int i=1;i<=n;i++)
			d[i]=x[i]-x[i-1];
		int m=nextInt();
		long k=nextLong();
		int swap[]=new int[n+1];
		for(int i=1;i<=n;i++)
			swap[i]=i;
		for(int i=1;i<=m;i++)
		{
			int a=nextInt();
			int temp=swap[a];
			swap[a]=swap[a+1];
			swap[a+1]=temp;
		}
		Permutations perm=new Permutations();
		swap=perm.exp(swap,k);
		d=perm.multiply(d,swap);
		double curr=0;
		for(int i=1;i<=n;i++)
			out.println(curr+=d[i]);
	}
	class Permutations
	{
		int[] exp(int a[],long k)
		{
			int n=a.length-1;
		    int ret[]=new int[n+1];
		    for(int i=1;i<=n;i++)
		    	ret[i]=i;
		    while(k>0)
		    {
		        if(k%2==1)
		            ret=multiply(ret,a);
		        a=multiply(a,a);
		        k=k/2;
		    }
		    return ret;
		}
		int[] multiply(int a[],int b[])
		{
			int n=a.length-1;
			int c[]=new int[n+1];
			for(int i=1;i<=n;i++)
				c[i]=a[b[i]];
			return c;
		}
	}

	 
	///////////////////////////////////////////////////////////

	public void run()throws IOException
	{
		br=new BufferedReader(new InputStreamReader(System.in));
		st=null;
		out=new PrintWriter(System.out);

		solve();
		
		br.close();
		out.close();
	}
	public static void main(String args[])throws IOException{
		new Main().run();
	}
	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;
	String nextToken()throws IOException{
		while(st==null || !st.hasMoreTokens())
		st=new StringTokenizer(br.readLine());
		return st.nextToken();
	}
	String nextLine()throws IOException{
		return br.readLine();
	}
	int nextInt()throws IOException{
		return Integer.parseInt(nextToken());
	}
	long nextLong()throws IOException{
		return Long.parseLong(nextToken());
	}
	double nextDouble()throws IOException{
		return Double.parseDouble(nextToken());
	}
}