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

string s;
int m, a[100005], f[100005];
int main(){
	cin >> s;
	cin >> m;
	for (int i = 1; i <= m; i++){
		cin >> a[i];
		f[a[i]]++;
		f[s.size()-a[i]+2]--;
	}
	for (int i = 1; i <= s.size(); i++){
		f[i] += f[i-1];
	}
	for (int i = 0; i <= s.size()/2; i++){
		if (f[i]%2) swap(s[i-1], s[s.size()-i]);
	}
	cout << s << endl;
	return 0;
}