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)

#include <stdio.h>
#include <string.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include <limits.h>
#include <math.h>
int acs(const void *a, const void *b){return *(int*)a - *(int*)b;} /* 1,2,3,4.. */
int des(const void *a, const void *b){return *(int*)b - *(int*)a;} /* 8,7,6,5.. */
int cmp_char(const void *a, const void *b){return *(char*)a - *(char*)b;} /* a,b,c,d.. */
int cmp_str(const void *a, const void *b){return strcmp(*(const char **)a, *(const char **)b);} /* aaa,aab.. */
#define min(a,b) (a < b ? a: b)
#define max(a,b) (a > b ? a: b)
#define rep(i, l, r) for (int i = l; i < r; i++)
#define MAX 100001
#define MOD 1000000007

typedef long long int lli;

int main(void) {
  int H, W;
  scanf("%d %d", &H, &W);
  char a[101][101];
  rep(hi, 0, H) {
    scanf("%s", a[hi]);
  }

  // 1行空白のものを見つける
  rep(hi, 0, H) {
    int judge = 1;
    rep(wi, 0, W) {
      if (a[hi][wi] == '.') continue;
      judge = 0;
      break;
    }
    if (judge) {
      rep(wi, 0, W) {
        a[hi][wi] = ' ';
      }
    }
  }
  // 1列空白のものを見つける
  rep(wi, 0, W) {
    int judge = 1;
    rep(hi, 0, H) {
      if (a[hi][wi] == '.' || a[hi][wi] == ' ') continue;
      judge = 0;
      break;
    }
    if (judge) {
      rep(hi, 0, H) {
        a[hi][wi] = ' ';
      }
    }
  }

  // 答えを出力
  rep(hi, 0, H) {
    int judge = 0;
    rep(wi, 0, W) {
      if (a[hi][wi] == ' ') continue;
      judge = 1;
      printf("%c", a[hi][wi]);
    }
    if ( judge ) printf("\n");
  }
  return 0;
}