문제2391--Pasha and String

2391: Pasha and String

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 3  통과: 3
[제출] [채점기록] [묻고답하기]

문제 설명

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 ai and reversed a piece of string (a segment) from position ai to position $|s| - ai + 1$. It is guaranteed that $2·ai  \leq |s|$. You face the following task: determine what Pasha's string will look like after m days.

입력 설명

The first line of the input contains Pasha's string s of length from 2 to 2·$10^5$ characters, consisting of lowercase Latin letters. The second line contains a single integer $m (1  \leq m  \leq  10^5)$ — the number of days when Pasha changed his string. The third line contains m space-separated elements $ai (1  \leq  ai) (2·ai  \leq  |s|)$ — the position from which Pasha started transforming the string on the $i$-th day.

출력 설명

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

입력 예시 Copy

abcdef
3
1 2 3

출력 예시 Copy

fbdcea