Problem: A mouse encountered a nice big cake and decided to take a walk across it, eating the berries on top of the cake on its way. The cake is rectangular, neatly divided into squares; some of the squares have a berry in them, and some don't.

The mouse is in a bit of a hurry, though, so once she enters the cake from its northwest corner (the top left cell in the input data), she will only go east (right) or south (down), until she reaches the southeast corner (the bottom right cell). She will eat every berry in the squares she passes through, but not in the other squares.

The mouse tries to choose her path so as to maximize the number of berries consumed. However, her haste and hunger might be clouding her judgement, leading her to suboptimal decisions...

Input

The first line of input contains two integers H and W (1 ≤ H, W ≤ 5), separated by a space, — the height and the width of the cake.

The next H lines contain a string of W characters each, representing the squares of the cake in that row: '.' represents an empty square, and '*' represents a square with a berry.

Output

Output the number of berries the mouse will eat following her strategy.

Examples

Input


4 3
*..
.*.
..*
...


Output


3


Input


4 4
.*..
*...
...*
..*.


Output


2


Input


3 4
..**
*...
....


Output


1


Input


5 5
..*..
.....
**...
**...
**...


Output


1

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
#include <iostream> 
#include <algorithm>
#include <string>
 
using namespace std;
 
#define ll              long long int
#define int             long long int
#define pb              push_back
#define sp              " "
#define sz(x)           (int)x.size()
#define all(x)          x.begin(),x.end()
#define fr(n)           for(__typeof(n) i=0;i<n;i++)
#define rep(i,a,b)      for(__typeof(b) i=a;i<b;i++)
#define repi(i,b,a)     for(__typeof(a) i=b;i>=a;i--)
#define tr(a)           for(auto it=a.begin();it!=a.end();it++)
#define dec(n)          std::cout << std::fixed;std::cout << std::setprecision(n);
#define PI              3.14159265358979323846 
#define vii             vector<int>
#define mpi             map<int,int>
#define mkp             make_pair 
#define fs              first
#define sn              second
#define memz(a)         memset(a,0,sizeof(a))
#define memn(a)         memset(a,-1,sizeof(a))
#define memp(a)         memset(a,1,sizeof(a))
#define endl            '\n'
#define FAST            ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define time_passed     1.0 * clock() / CLOCKS_PER_SEC
#define mod             1000000000+7;
#define hell            1000000007
#define INF 1e9+7


void solve()
{
    int n,m;
    cin>>n>>m;
    string s[n];
    fr(n)cin>>s[i];
    int x=0,y=0;
    int ans=0;
    for(int i=0;i<n+m-1;i++)
    {
        if(s[x][y]=='*')
            ans++;
        if(y+1<m && s[x][y+1]=='*')
        {
            y++;
        }
        else if(x+1<n && s[x+1][y]=='*')
        {
            x++;
        }
        else if(y+1<m)
            y++;
        else
            x++;
    }
    cout<<ans<<endl;
}

signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("INPUT.txt","r",stdin);
    freopen("OUTPUT.txt","w",stdout);
    #endif
    FAST
    int TEST=1;
    //cin>>TEST;
    while(TEST--)
    {
     solve();
    }
 
    cerr<<endl<<"Time elapsed : "<<time_passed<<endl;
    return 0;
    
}