Problem:
Score : 200 points

Problem Statement

There is a grid of squares with H horizontal rows and W vertical columns.
The square at the i-th row from the top and the j-th column from the left is represented as (i, j).
Each square is black or white.
The color of the square is given as an H-by-W matrix (a_{i, j}).
If a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.

Snuke is compressing this grid.
He will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:

Operation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.

It can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.
Find the final state of the grid.

Constraints

1 \leq H, W \leq 100

a_{i, j} is . or #.

There is at least one black square in the whole grid.

Input

Input is given from Standard Input in the following format:

H W
a_{1, 1}...a_{1, W}
:
a_{H, 1}...a_{H, W}

Output

Print the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.

Sample Input 1

4 4
##.#
....
##.#
.#.#

Sample Output 1

###
###
.##

The second row and the third column in the original grid will be removed.

Sample Input 2

3 3
#..
.#.
..#

Sample Output 2

#..
.#.
..#

As there is no row or column that consists only of white squares, no operation will be performed.

Sample Input 3

4 5
.....
.....
..#..
.....

Sample Output 3

#

Sample Input 4

7 6
......
....#.
.#....
..#...
..#...
......
.#..#.

Sample Output 4

..#
#..
.#.
.#.
#.#

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

// 課題5_3 AtCoder Beginner Contest 107 B - Grid Compression
// nk777
 
#include<stdio.h>
#define LIM 100

int main(void){
    // H行line,W列col,,for文のカウンタi,j,黒がある行と列を記憶する配列lineBlack,colBlack(初期値0)
    int line, col, i, j, lineBlack[LIM+1] = {0}, colBlack[LIM+1] = {0};
    // 入力格納2次元配列matrix
    char matrix[LIM+1][LIM+1];

    // line, colを受け取る
    scanf("%d %d", &line, &col);
    

    for (i = 0; i < line; i++)
    {
        for (j = 0; j < col; j++)
        {
            // 入力されるマス目の色を受け取る
            scanf(" %c", &matrix[i][j]);
            // もし黒だったら
            if (matrix[i][j] == '#')
            {
                // 黒があることを記録
                lineBlack[i] = 1;
                colBlack[j] = 1;
            } 
        }
    }

    // 黒が一つでもある行と列を出力
    for (i = 0; i < line; i++)
    {
        if (lineBlack[i] == 1)
        {
           for (j = 0; j < col; j++)
           {
               if (colBlack[j] == 1)
               {
                    // 行も列も黒があるときだけ表示
                    printf("%c", matrix[i][j]);
               }
           }

            // 1行終わるごとに改行する
            printf("\n");
        }
    }
    
    return 0;
}