CF525B 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 $ 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}

The first line of the input contains Pasha's string $ s $ of length from $ 2 $ to $ 2·10^{5} $ characters, consisting of lowercase Latin letters. The second line contains a single integer $ m $ ( $ 1

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