Editing 2018 Dec Silver Problem 3 Mooyo Mooyo (section)

== Problem ==

The problem presents a 2D game grid which is N x 10 (N≤100) squares, each square either contains a cow or is empty. Adjacent squares sharing an edge (not only a corner) with the same number are part of the same component. If a component contains at least K squares (K≤N), it's removed from the grid, and all cows above it in the same column fall down to take the places of the cows in the removed component, potentially forming new components. This process continues until no component contains K or more squares.

The task is to simulate this process and output the final state of the board.

=== Input ===

The first line of input contains two integers N and K (1≤N≤100). The next N lines contain 10 digits each, specifying the initial state of the grid.

=== Output ===

The output should be N lines, each containing 10 digits, showing the final state of the game board.