CF525B.Pasha and String

Pasha got a very beautiful string s for his birthday, the string consists of lowercase Latin letters. The letters in the string are numbered from 1 to |s| from left to right, where |s| is the length of the given string.

Pasha didn't like his present very much so he decided to change it. After his birthday Pasha spent m days performing the following transformations on his string — each day he chose integer a__i and reversed a piece of string (a segment) from position a__i to position |s| - a__i + 1. It is guaranteed that 2·a__i ≤ |s|.

You face the following task: determine what Pasha's string will look like after m days.

帕沙生日时收到了一个非常漂亮的字符串 $s$，该字符串由小写拉丁字母组成。字符串中的字符从左到右编号为 $1$ 到 $|s|$，其中 $|s|$ 表示给定字符串的长度。

帕沙并不太喜欢这份礼物，于是决定对它进行修改。生日过后，帕沙花费了 $m$ 天对字符串执行如下变换——每天他选择一个整数 $a_i$，并将字符串中从位置 $a_i$ 到位置 $|s| - a_i + 1$ 的子串（即一个区间）进行翻转。题目保证 $2 \cdot a_i \leq |s|$。

你需要完成以下任务：确定经过 $m$ 天后帕沙的字符串将变成什么样子。

The first line of the input contains Pasha's string s of length from 2 to 2·105 characters, consisting of lowercase Latin letters.

The second line contains a single integer m (1 ≤ m ≤ 105) — the number of days when Pasha changed his string.

The third line contains m space-separated elements a__i (1 ≤ a__i; 2·a__i ≤ |s|) — the position from which Pasha started transforming the string on the i-th day.

输入的第一行包含帕沙的字符串 $s$，其长度为 $2$ 到 $2\cdot10^5$ 个字符，由小写拉丁字母组成。

第二行包含一个整数 $m$（$1\le m\le 10^5$）—— 帕沙修改字符串的天数。

第三行包含 $m$ 个以空格分隔的整数 $a_i$（$1\le a_i$；$2\cdot a_i\le |s|$）—— 表示第 $i$ 天帕沙开始变换字符串的位置。

In the first line of the output print what Pasha's string s will look like after m days.

在输出的第一行打印帕沙的字符串 $s$ 经过 $m$ 天后的结果。