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)

/* ex7_3
   UMAboogie */
#include<stdio.h>
#include<stdlib.h>

int main(void){
  int height,width;
  char **grid;

  
  scanf("%d %d",&height,&width); //マスのたての数、横の数を入力
  
  //各行の配列へのポインタ分のメモリ領域を確保
  grid = (char**)calloc(height, sizeof(char*));
  if(grid == NULL){
    fprintf(stderr, "memory allocation error.\n");
    exit(1);
  }

  //各行の要素分のメモリ領域を確保
  for(int i=0;i<height;i++){
    grid[i] = (char*)calloc(width, sizeof(char));
    if(grid[i] == NULL){
      fprintf(stderr, "memory allocation error.¥n");
      exit(1);
    }
  }
  
  int row_exist[100] = {0}; //その行のマスに黒があるかの真偽値を入れる配列
  int col_exist[100] = {0}; //その列のマスに黒があるかの真偽値を入れる配列

  
  for(int i = 0;i < height;i++){
    for(int j = 0;j < width;j++){
      scanf(" %c",&grid[i][j]); //(i,j)の配色を入力
      if(grid[i][j] == '#'){ //もし黒であれば、各真偽値を1とする
        row_exist[i]=1;
        col_exist[j]=1;
      }
    }
  }
  for(int i = 0;i < height;i++){
    if(row_exist[i] == 1 ){ //まず黒がある行について
      for(int j = 0;j < width;j++){
        if(col_exist[j] == 1){ //黒がある列であれば
          printf("%c",grid[i][j]); //配色を出力
        }
      }
      printf("\n"); //行ごとに改行
    }
  }
  //メモリ領域の解放（逆順）
  for(int i = 0; i < height; i++){
          free(grid[i]);
  }
  free(grid);
  
  return 0;
}