Master of the Shell Game

Younghoon is so skilled at the shell game that he can find the hidden ball with his eyes closed. To trick him, you will play a shell game with a string instead of cups.

Given a string $S$, apply $T$ swaps in order and print the result. Each swap exchanges the character at position $A$ of $S$ with the character at position $B$.

The first line contains the string $S$. Its length is at least $1$ and at most $100$, and it consists only of uppercase and lowercase English letters and hyphens ($-$).

The second line contains the number of swaps $T$, where $1 \le T \le 50$.

Each of the following $T$ lines contains two integers $A$ and $B$ separated by a space. $A$ and $B$ are integers with $0 \le A, B < |S|$, where the first character of the string is position $0$.

Print the final string after applying all $T$ swaps, on one line.