#include <cstring>
#include <iostream>
#include <fstream>
using namespace std;

ifstream f("date.in");

int n, m;
char a[105][105];
int dp[105][105];

int main()
{
    memset(dp, -1, sizeof(dp));
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> (a[i] + 1);
    }

    int mx = 0;
    dp[0][1] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (a[i][j] == '&') {
                dp[i][j] = -1;
                continue;
            }

            if (dp[i - 1][j] == -1 && dp[i][j - 1] == -1) {
                dp[i][j] = -1;
            } else if (dp[i - 1][j] == -1) {
                dp[i][j] = dp[i][j - 1] + 1;
            } else if (dp[i][j - 1] == -1) {
                dp[i][j] = dp[i - 1][j] + 1;
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + 1;
            }

            mx = max(mx, dp[i][j]);
        }
    }
    cout << mx << endl;

    return 0;
}