#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
template<typename T,typename... A>
void err(T a,A... x){cout << a << ' '; err(x...);}
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
template<class T> void mkuni(vector<T>&v)
{
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
template<class T>
void print(T x,int suc=1)
{
    cout<<x;
    if(suc==1) cout<<'\n';
    else cout<<' ';
}
template<class T>
void print(const vector<T>&v,int suc=1)
{
    for(int i=0;i<v.size();i++)
        print(v[i],i==(int)(v.size())-1?suc:2);
}
int f[12];
char a[10][10];
int main() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= m; ++j)
			cin >> a[i][j];
	}
	int ans = 0;
	int x = 1, y = 1;
	if(a[x][y] == '*') ++ans;
	for(;;) {
		vc<pi> b;
		int mi = 1e9;
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= m; ++j) {
				if(a[i][j] == '*' && i >= x && j >= y && !(i == x && j == y)) {
					if(mi >= abs(i - x) + abs(j - y)) mi = abs(i - x) + abs(j - y);
				}
			}
		}
		//cout << mi << endl;
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= m; ++j) {
				if(a[i][j] == '*' && i >= x && j >= y && !(i == x && j == y)) {
					if(mi == abs(i - x) + abs(j - y)) {
						b.emplace_back(i, j);
					}
				}
			}
		}
		//cout << b[0].first << " " << b[0].second << endl;
		//cout << b[1].first << " " << b[1].second << endl;
		if(b.size() == 0) break;
		if(b.size() == 1) x = b[0].first, y = b[0].second, ++ans;
		else {
			y += 1;
			if(a[x][y] == '*') ++ans;
		}
		if(x == n && y == m) break;
		//sort(b.begin(), b.end())
	}
	print(ans);
} 
 