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 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.
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.
In the first line of the output print what Pasha's string s will look like after m days.
def solve():
    s = input().strip()
    m = int(input())
    a = list(map(int, input().strip().split()))
    s = [c for c in s]
    changes = [0] * len(s)
    for i in range(m):
        changes[a[i] - 1] += 1
    for i in range(1, len(s) // 2):
        changes[i] += changes[i - 1]
    for i in range(len(s) // 2):
        if changes[i] % 2 == 1:
            (s[i], s[~i]) = (s[~i], s[i])
    print(''.join(s))
if __name__ == '__main__':
    solve()
s = input()
m = int(input())
transforms = list(map(int, input().split()))
reversals = [0] * len(s)
for ai in transforms:
    reversals[ai - 1] += 1
    reversals[len(s) - ai] -= 1
prefix_sum = 0
result = list(s)
for i in range(len(s) // 2):
    prefix_sum += reversals[i]
    if prefix_sum % 2 != 0:
        (result[i], result[len(s) - i - 1]) = (result[len(s) - i - 1], result[i])
result = ''.join(result)
print(result)
s = [' '] + list(input())
n = len(s)
m = int(input())
a = [0] * (n // 2 + 10)
for x in input().split():
    a[int(x)] += 1
for i in range(1, n // 2 + 1):
    a[i] += a[i - 1]
for i in range(n // 2 + 1):
    if a[i] & 1:
        (s[i], s[n - i]) = (s[n - i], s[i])
print(''.join(s[1:]))