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.

Sample test(s)

input abcdef 1 2 output aedcbf

input vwxyz 2 2 2 output vwxyz

input abcdef 3 1 2 3 output fbdcea

I noticed that reverse the string 2 times returns the original string, so, if we reverse the string of length l, from [a,l-a+1], then reverse [b, l-b+1] where a < b, will returns the string [1...a, l-a+1...l-b+1, b....l-b, b...a, l-a+2...l] So, I sort out the position to reverse first, then loop through the position and do reverse.

import java.io.*; import java.util.Scanner; public class Solution{

public static void sort(int a[], int s, int e){
    int i = s, j = e;
    int pivot = a[(s+e)/2];
    while(i <= j){
       while(a[i] < pivot){
         i++;
       }
       while(a[j] > pivot){
         j--;
       }
       if(i<=j){
         swap(a, i, j);
         i++;
         j--;
       }
    }
    if(s < j){
       sort(a, s, j);
    }
    if(i < e){
       sort(a, i, e);
    }
}
public static void swap(int[] a, int i, int j){
    int temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}
public static void swap(char[] a, int i, int j){
    char temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}
public static void rev(char[] c, int s, int e){
    int l = c.length;
    for(int i=s;i<e;i++){
       swap(c, i-1, l-i);
    }
}

public static void main(String[] args){
    Scanner scanner = new Scanner(System.in);
    String s = scanner.next();
    char[] c = s.toCharArray();
    int m = scanner.nextInt();
    int a[] = new int[m];
    for(int i=0;i<m;i++){
       a[i] = scanner.nextInt();
    }
    sort(a, 0, m-1);
    for(int i=0;i<m;i+=2){
       if(i+1 < m){
         rev(c, a[i], a[i+1]);
       }else{
         rev(c, a[i], c.length/2 + 1);
       }
    }
    System.out.println(new String(c));
}

}