from cmath import *
from decimal import *
from operator import index
from re import I
import sys
from tkinter import N
input_ = sys.stdin.readline
def _input(): return map(int, input().split())
def _list(): return list(map(int, input().split()))
def solves():
n,m=_input()
a=[]
check=0
mncol=m
mxcol=0
mxrow=0
mnrow=n
for i in range(n):
x=list(input())
k=x.count('*')
if (k>=1):
mxrow=max(mxrow,i)
mnrow=min(mnrow,i)
mncol=min(mncol,x.index('*'))
for j in range(m-1,mncol-1,-1):
if (x[j]=='*'):
mxcol=max(mxcol,j)
break
a.append(x)
for i in range(mnrow,mxrow+1):
for j in range(mncol,mxcol+1):
print(a[i][j],end='')
print()
t=1
for _ in range(0,t):
solves()#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<pair<ll, int>> vpll;
const ll q=25;
const ll z=0;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
// freopen("input.txt","r", stdin);
int n,m;cin>>n>>m;
vector<string> vs(n);
int i1=55,i2=-1,j1=55,j2=-1;
for(int i=0;i<n;i++){
cin>>vs[i];
for(int j=0;j<m;j++){
if (vs[i][j]=='*'){
i1=min(i1, i);
i2=max(i2, i);
j1=min(j1, j);
j2=max(j2, j);
}
}
}
for(int i=i1;i<=i2;i++){
for(int j=j1;j<=j2;j++){
cout << vs[i][j];
}
cout << endl;
}
}
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |