String Conversion and Queries

You are given a string $S$ of uppercase and lowercase English letters. You are also given a list $A$ of $n$ queries on $S$. Each query is one of the following two types.

• $1\ i_1\ i_2$: Change every character $i_1$ in $S$ to the character $i_2$. If $S$ has no character $i_1$, $S$ is not changed.
• $2$: Print $S$ after applying all type $1$ queries given so far, in order.

The first line contains the string $S$ and the integer $n$ in that order.

Each of the next $n$ lines contains one query, from the first query to the last. A type $1$ query is the integer $1$ followed by the characters $i_1$ and $i_2$, separated by a space. A type $2$ query is the integer $2$ alone.

For each type $2$ query, print the result on its own line, in order.

• $1 \le$ length of $S \le 100{,}000$
• $S$ consists of uppercase and lowercase English letters.
• $1 \le n \le 300{,}000$
• Every query in $A$ is of type $1$ or type $2$.
• $A$ contains at least one type $2$ query.
• $1 \le$ total number of characters printed by type $2$ queries $\le 10^7$
• Newline characters are not counted as printed characters.
• $i_1$ and $i_2$ are uppercase or lowercase English letters.