Problem Statement

There are $N$ squares arranged in a horizontal row, numbered square $1$ to square $N$ from left to right. Colors are represented by lowercase English letters.

Initially, the color of every square is a, and nothing is placed on any square.

You are given $Q$ queries; process them in the given order. Each query is of one of the following two types:

• 1 X : If no tile is placed on square $X$, place a tile on it; if a tile is placed on it, remove it.
• 2 C : Change the color of every square on which no tile is placed to $C$.

Find the color of each square after processing all queries (regardless of whether a tile is placed on it).

Constraints

• $1 \le N,Q \le 3\times 10^5$
• Each query is of type $1$ or type $2$.
• In type-$1$ queries, $X$ is an integer satisfying $1 \le X \le N$.
• In type-$2$ queries, $C$ is a single lowercase English letter.

Input

The input is given from Standard Input in the following format:

N Q
\mathrm{query}_1
\vdots
\mathrm{query}_Q

Each query $\mathrm{query}_i ~ (1 \le i \le Q)$ is given in the form

1 X

or

2 C

Output

Output the final colors of the squares as a string of length $N$, concatenated from left to right.