using System;
using System.Collections.Generic;
using System.Linq;
using CompLib.Collections;
using CompLib.Mathematics;
using CompLib.Util;

public class Program
{
    private int N;
    private long[] X;
    private int M;
    private long K;
    private int[] A;

    public void Solve()
    {
        var sc = new Scanner();
        /*
         * aがbを選んで移動
         * a := 2b-a
         * iが選ばれた 期待値 x_{i-1} + x_{i+1} - x_i
         *
         * ダブリング
         */
        N = sc.NextInt();
        X = sc.LongArray();
        M = sc.NextInt();
        K = sc.NextLong();
        A = sc.Array().Select(s => int.Parse(s) - 2).ToArray();

        long[] dx = new long[N - 1];
        for (int i = 0; i < N - 1; i++)
        {
            dx[i] = X[i + 1] - X[i];
        }

        int[] set = new int[N - 1];
        for (int i = 0; i < N - 1; i++)
        {
            set[i] = i;
        }

        foreach (int i in A)
        {
            int t = set[i];
            set[i] = set[i + 1];
            set[i + 1] = t;
        }

        long[] next = new long[N - 1];
        int[] tmp = new int[N - 1];
        while (K > 0)
        {
            if (K % 2 == 1)
            {
                for (int i = 0; i < N - 1; i++)
                {
                    next[i] = dx[set[i]];
                }

                Array.Copy(next, dx, N - 1);
            }

            for (int i = 0; i < N - 1; i++)
            {
                tmp[i] = set[set[i]];
            }

            Array.Copy(tmp, set, N - 1);
            K /= 2;
        }

        long[] ans = new long[N];
        ans[0] = X[0];
        for (int i = 0; i < N - 1; i++)
        {
            ans[i + 1] = ans[i] + dx[i];
        }

        Console.WriteLine(string.Join("\n", ans));
    }

    public static void Main(string[] args) => new Program().Solve();
}

namespace CompLib.Collections
{
    using System.Collections.Generic;

    public class HashMap<TKey, TValue> : Dictionary<TKey, TValue>
    {
        public new TValue this[TKey key]
        {
            get
            {
                TValue o;
                return TryGetValue(key, out o) ? o : default(TValue);
            }
            set { base[key] = value; }
        }
    }
}

// https://bitbucket.org/camypaper/complib
namespace CompLib.Mathematics
{
    using System.Diagnostics;
    using N = Int64;

    #region Matrix

    public class Matrix
    {
        int row, col;
        public N[] mat;

        /// <summary>
        /// <paramref name="r"/> 行 <paramref name="c"/> 列目の要素へのアクセスを提供します。
        /// </summary>
        /// <param name="r">行の番号</param>
        /// <param name="c">列の番号</param>
        public N this[int r, int c]
        {
            get { return mat[r * col + c]; }
            set { mat[r * col + c] = value; }
        }

        public Matrix(int r, int c)
        {
            row = r;
            col = c;
            mat = new N[row * col];
        }

        public static Matrix operator *(Matrix l, Matrix r)
        {
            Debug.Assert(l.col == r.row);
            var ret = new Matrix(l.row, r.col);
            for (int i = 0; i < l.row; i++)
            for (int k = 0; k < l.col; k++)
            for (int j = 0; j < r.col; j++)
                ret.mat[i * r.col + j] = (ret.mat[i * r.col + j] + l.mat[i * l.col + k] * r.mat[k * r.col + j]);
            return ret;
        }

        /// <summary>
        /// <paramref name="m"/>^<paramref name="n"/> を O(<paramref name="m"/>^3 log <paramref name="n"/>) で計算します。
        /// </summary>
        public static Matrix Pow(Matrix m, long n)
        {
            var ret = new Matrix(m.row, m.col);
            for (int i = 0; i < m.row; i++)
                ret.mat[i * m.col + i] = 1;
            for (; n > 0; m *= m, n >>= 1)
                if ((n & 1) == 1)
                    ret = ret * m;
            return ret;
        }

        public N[][] Items
        {
            get
            {
                var a = new N[row][];
                for (int i = 0; i < row; i++)
                {
                    a[i] = new N[col];
                    for (int j = 0; j < col; j++)
                        a[i][j] = mat[i * col + j];
                }

                return a;
            }
        }
    }

    #endregion
}

namespace CompLib.Util
{
    using System;
    using System.Linq;

    class Scanner
    {
        private string[] _line;
        private int _index;
        private const char Separator = ' ';

        public Scanner()
        {
            _line = new string[0];
            _index = 0;
        }

        public string Next()
        {
            if (_index >= _line.Length)
            {
                string s;
                do
                {
                    s = Console.ReadLine();
                } while (s.Length == 0);

                _line = s.Split(Separator);
                _index = 0;
            }

            return _line[_index++];
        }

        public string ReadLine()
        {
            _index = _line.Length;
            return Console.ReadLine();
        }

        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public decimal NextDecimal() => decimal.Parse(Next());
        public char NextChar() => Next()[0];
        public char[] NextCharArray() => Next().ToCharArray();

        public string[] Array()
        {
            string s = Console.ReadLine();
            _line = s.Length == 0 ? new string[0] : s.Split(Separator);
            _index = _line.Length;
            return _line;
        }

        public int[] IntArray() => Array().Select(int.Parse).ToArray();
        public long[] LongArray() => Array().Select(long.Parse).ToArray();
        public double[] DoubleArray() => Array().Select(double.Parse).ToArray();
        public decimal[] DecimalArray() => Array().Select(decimal.Parse).ToArray();
    }
}

Measured memory_bytes: 45324