#include //#include using namespace std; //#pragma GCC optimize("Ofast") //#pragma GCC optimize ("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); //#define int long long typedef long long ll; #define F first #define S second #define pb emplace_back string s[100005]; map,int> dp; vector v[100005]; int rea[100005],ans[100005]; int n,m; bool vis[100005]; /*bool cmp(pair,int> p1,pair,int> p2) { if(p1.F.F!=p2.F.S) return p1.F.F>,int>,vector>,int>>,greater>,int>>> pq; for(int i=0;i<=m;i++) vis[i]=0; for(int i=0;i<=m;i++) { for(auto j:v[i]) if(s[x][j]!='#') { //cout<<"?? "<>,int> p=pq.top(); pq.pop(); //cout<<"rtny ujunyt "<=0&&s[x][p.S-1]!='#') pq.push(make_pair(make_pair(max(p.F.F,1),make_pair(1,-1)),p.S-1)); } else if(p.F.S.S>0) { if(p.S+1=0&&s[x][p.S-1]!='#') pq.push(make_pair(make_pair(max(p.F.F,-p.F.S.S+1),make_pair(-p.F.S.S+1,p.F.S.S-1)),p.S-1)); } } } //cout<<'\n'; } signed main() { cin.tie(0); ios_base::sync_with_stdio(0); cin>>n>>m; for(int i=0;i>s[i]; for(int i=0;i=0;i--) { //cout<