Tower

Jonas likes playing with colored cubes. He stacked $N$ cubes one on top of another to build a tower. Jonas is unhappy with the tower. He wants to rebuild it so that no long monochrome runs of cubes remain.

To do this, Jonas removes all maximal monochrome contiguous runs of at least $K$ cubes from the tower.

For example, take the tower below and $K = 3$. Jonas removes the long run of green cubes. The result is the new tower below.

If the tower has several runs to remove, all of them are removed at the same time.

After the tower is rebuilt, new long runs of the same color may appear. In that case Jonas again finds all monochrome runs of length at least $K$, removes them, and rebuilds the tower without them.

In this tower the run of red cubes has length $K = 3$, so Jonas rebuilds the tower again.

This rebuilding process can repeat for a long time. Find what the tower looks like after all rebuilds are finished.

The first line contains two integers $N$, the height of the tower, and $K$.

The next $N$ lines contain the colors of the cubes in the tower, given as integers. The first line gives $c_1$, the color of the top cube. The second line gives $c_2$, the color of the cube below the first one. In general, line $i$ gives $c_i$, the color of the cube below cube $i-1$. The last line gives $c_N$, the color of the bottom cube.

The first line contains $N'$, the height of the tower after all rebuilds.

The next $N'$ lines contain $c'_1, c'_2, \dots, c'_{N'}$, one per line, the colors of the cubes from the top of the tower to the bottom.

$1 \le N, K, c_i \le 1\,000\,000$