#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 10005;
int T,n,m,t;
int a[maxn], fa[maxn], root[maxn], ah[maxn];
char s[100][100];
int main() {

    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> s[i][j];

    int x = 1, y = 1, ans = 0;
    if(s[1][1] == '*') ans++;
    while(x <= m && y <= n){
        if(x <= m && s[y][x+1] == '*'){
            x++;
            ans++;
        }
        else if(y <= n && s[y+1][x] == '*'){
            y++;
            ans++;
        }
        else if(x != m) x++;
        else y++;
    }
    cout << ans;
}
 
