#include <bits/stdc++.h>
using namespace std;
const int MAXN = 50;
char mp[MAXN][MAXN];
int n, m;
int dir[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
bool in(int x, int y) {
return (x >= 1 && x <= n && y >= 1 && y <= m);
}
int BFS() {
queue<pair<int, int>> q;
q.push({1, 1});
mp[1][1] = '#'; // 标记起点已访问
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> mp[i][j];
}
}
int result = BFS();
cout << result << endl;
return 0;
}
