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 9.2.1) (judge verdict: Accepted)

/* ex 7_3
   TakayukiY*/

#include<stdio.h>
#include<stdlib.h>

int main(void){
    //indexと行列の要素数と空行チェック用の配列のポインタの定義
    int i,j,row,column,*chkrow,*chkcol;
    //aijの格納配列の定義
    char **ptr;

    //要素数を代入して各行のメモリ確保、エラーチェック
    scanf("%d%d\n",&row,&column);
    ptr=(char**)calloc(row,sizeof(char*));
    if(ptr==NULL) exit(1);

    for(i=0;i<row;i++){
        //各列のメモリ確保、エラーチェック
        ptr[i]=(char*)calloc(column,sizeof(char));
        if(ptr==NULL) exit(1);
        
        //各要素を代入
        for(j=0;j<column;j++){
            scanf("%c",&ptr[i][j]);
        }
        //末尾の改行をスキップ
        getchar();
    }

    //空行チェック用の配列のメモリ確保
    chkrow=(int*)calloc(row,sizeof(int));
    chkcol=(int*)calloc(column,sizeof(int));

    //0で初期化
    for(i=0;i<row;i++) *(chkrow+i)=0;
    for(j=0;j<column;j++) *(chkcol+j)=0;

    //行列の各要素のいずれかが空白でないならチェック用配列に1を代入
    for(i=0;i<row;i++){
        for(j=0;j<column;j++){
            if(ptr[i][j]=='#'){
                *(chkrow+i)=1;
                *(chkcol+j)=1;
            }
        }
    }

    //空白でない行・列に対して出力→圧縮
    for(i=0;i<row;i++){
        if(chkrow[i]==1){
            for(j=0;j<column;j++){
                if(chkcol[j]==1){
                    printf("%c",ptr[i][j]);
                }
            }
            printf("\n");
        }
    }

    //メモリの解放
    for(i=0;i<row;i++){
        free(ptr[i]);
    }
    free(ptr);

    return 0;
}