#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int h, w; cin >> h >> w;
	vector<P>ans;
	vector<string>s(h);
	rep(i, h)cin >> s[i];
	rep(i, h)rep(j, w) {
		if (s[i][j] == '#')continue;
		if (i != h - 1 && s[i + 1][j] == '.' && (i == 0 || s[i - 1][j] == '#'))ans.emplace_back(i, j);
		else if (j != w - 1 && s[i][j + 1] == '.'
			&& (j == 0 || s[i][j - 1] == '#'))ans.emplace_back(i, j);
	}
	cout << ans.size() << endl;
	for (auto [a, b] : ans)cout << a + 1 << " " << b + 1 << endl;
	return 0;
}