CF 525B Pasha and String

B. Pasha and String

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

The second line contains a single integer m (1 ≤ m ≤ 10⁵) —  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.

Output

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

Sample test(s)

Input

abcdef
1
2

Output

aedcbf

Input

vwxyz
2
2 2

Output

vwxyz

Input

abcdef
3
1 2 3

Output

fbdcea

解析

所有的变换都是关于中心的镜像对称，然后显然变换的顺序和结果无关，那么我只用知道一个点被翻转的次数的奇偶性。

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

string s;
int M,Q[100100],B[100100];
int main()
{
	//std::ios::sync_with_stdio(false);
	cin >>s >>M;
	int len=s.size();

	for(int i=1;i<=M;i++)
	{
		int a; cin >>a;
		B[min(a,len-a+1)-1]++;
	}
	for(int i=1;i<(len+1)>>1;i++) B[i]+=B[i-1];
	for(int i=0;i<(len+1)>>1;i++)
		if(B[i]&1) swap(s[i],s[len-i-1]);
	cout <<s<<endl;
	return 0;
}