链接：https://codeforces.com/contest/525/problem/B

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 ≤ |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·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 ai (1 ≤ ai; 2·ai ≤ |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.

Examples

input

Copy

abcdef
1
2

output

Copy

aedcbf

input

Copy

vwxyz
2
2 2

output

Copy

vwxyz

input

Copy

abcdef
3
1 2 3

output

Copy

fbdcea

代码：

#include<bits/stdc++.h>
using namespace std;
long long a[2000000]={0};
long long n,t,b;
string s;
int main()
{
	cin>>s;
	cin>>t;
	while(t--)
	{
		cin>>b;
		if(!a[b])
		{
			a[b]=1;
		}
		else
		{
			a[b]++;
		}
	}
	int sum=0;
	for(int i=0;i<s.length()/2;i++)
	{
		sum+=a[i+1];
		if(sum&1)
		swap(s[i],s[s.length()-1-i]);
	}
	cout<<s<<endl;
}