B - Letter（最小覆盖矩形）

Problem description

A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with n rows and m columns. Bob shaded some of the squares on the sheet. Having seen his masterpiece, he decided to share it with his elder brother, who lives in Flatland. Now Bob has to send his picture by post, but because of the world economic crisis and high oil prices, he wants to send his creation, but to spend as little money as possible. For each sent square of paper (no matter whether it is shaded or not) Bob has to pay 3.14 burles. Please, help Bob cut out of his masterpiece a rectangle of the minimum cost, that will contain all the shaded squares. The rectangle's sides should be parallel to the sheet's sides.

Input

The first line of the input data contains numbers n and m (1 ≤ n, m ≤ 50), n — amount of lines, and m — amount of columns on Bob's sheet. The following n lines contain m characters each. Character «.» stands for a non-shaded square on the sheet, and «*» — for a shaded square. It is guaranteed that Bob has shaded at least one square.

Output

Output the required rectangle of the minimum cost. Study the output data in the sample tests to understand the output format better.

Examples

Input

6 7
.......
..***..
..*....
..***..
..*....
..***..

Output

***
*..
***
*..
***

Input

3 3
***
*.*
***

Output

***
*.*
***
解题思路：输出最小覆盖所有星号的矩形。
AC代码：

 #include<bits/stdc++.h>
 using namespace std;
 int main(){
     int n,m,rou,rod,colt,cort;char s[][];
     cin>>n>>m;getchar();
     rou=n-,rod=,colt=m-,cort=;
     for(int i=;i<n;++i)
         for(int j=;j<m;++j)
             cin>>s[i][j];
     for(int i=;i<n;++i){
         int j=,k=m-;
         while(j<m && s[i][j]=='.')j++;
         while(k>= && s[i][k]=='.')k--;
         if(j<=k){
             colt=min(colt,j);cort=max(cort,k);//确定列的左右最大范围
             rou=min(i,rou);rod=max(rod,i);//确定行的上下最大范围
         }
     }
     for(int i=rou;i<=rod;++i){
         for(int j=colt;j<=cort;++j)cout<<s[i][j];
         cout<<endl;
     }
     return ;
 }