func_code_string: #include<bits/stdc++.h>   using namespace std;   #define int long long int   #define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)   #define pii pair<int,int>   #define F first   #define S second   #define pb push_back   const int mod1=998244353,mod2=(int) 1e9+7;   int power(int n,int k,int mod){int ans=1; n=n%mod;while(k>0){if(k&1)ans=(ans*n)%mod;n=(n*n)%mod;k>>=1;}return (ans+mod)%mod;}//negative nos & 0^0   struct triplet{int a,b,c;};bool operator < (const triplet &t1,const triplet &t2){if(t1.a<t2.a)return true;if(t1.a==t2.a && t1.b <t2.b)return true;if(t1.a==t2.a && t1.b ==t2.b && t1.c<t2.c)return true;return false;}   // memset(dp, -1, sizeof dp);         void problemSolver()   {       int h,w;    cin>>h>>w;    string s[h];    for(int i=0;i<h;i++)     cin>>s[i];    int i=0,j=0,c=0;    if(s[0][0]== * )      c++;         while(i<=h-1 && j<=w-1)    {        if(j+1<w && s[i][j+1]== * )      j++;     else if(i+1<h && s[i+1][j]== * )      i++;     else if(j+1<w)      j++;     else       i++;        if(s[i][j]== * )      c++;     if(i==h-1 && j==w-1)      break;       }    cout<<c;   }             int32_t main()   {      //  fio;    #ifndef ONLINE_JUDGE    freopen( input.txt ,  r , stdin);    freopen( output.txt ,  w , stdout);    #endif    int testcases=1;       // cin>>testcases;       while(testcases--)       problemSolver();       }