#include<iostream>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<cstdio>
#include <utility>
#include<iomanip>
using namespace std;
typedef long long LL;
const int maxn = 8;
const int mod = 1e9 + 7;
const LL _inf = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
int n, m, a, b, t, A, B, a1, b1, a2, b2;
char c[maxn][maxn];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j)
            cin >> c[i][j];
    }
    A = B = 1;
    if (c[1][1] == '*')
        ++a;
    while (A + B != n + m) {
        t = 100000;
        for (int i = n; i >= A; --i) {            
            for (int j = B; j <= m; ++j) {
                if (c[i][j] == '*') {
                    b = (i - A) + (j - B);
                    if (b == 0)
                        continue;
                    if (b <= t) {
                        t = b;
                        a1 = i;
                        b1 = j;
                    }
                }
            }
        }
        if (t == 100000)
            break;
        else {
            ++a;
            A = a1;
            B = b1;
        }
    }
    cout << a << '\n';
    return 0;
}
