#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int vis[N][N] = {0}, n, m;
char a[N][N];
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
void dfs(int x, int y) {
if (x > n || y > m || x < 1 || y < 1 || a[x][y] == '.')
return;
}
int main() {
int tot = 0;
cin >> n >> m;
}
