#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<string> s(n+5,string(m+5,' '));
	for(int i=1;i<=n;i++)
	{
		string t;
		cin>>t;
		s[i]=' '+t+"    ";
	}
	vector<tuple<int,int,int,int>> ans;
	function<void(int,int)> dfs=[&](int x,int y)
	{
//		cerr<<"dfs "<<x<<' '<<y<<endl;
		int r,d;
		for(r=y+1;r<=m;r++)
		{
			if(s[x+1][r]=='X')
			{
				if(s[x+2][r]=='X' and s[x][r+1]=='X' and s[x+1][r+1]=='X' and s[x+2][r+1]!='X' and s[x][r+2]=='X')
					dfs(x+1,r);
				else
					break;
			}
		}
		for(d=x+1;d<=n;d++)
		{
			if(s[d][y+1]=='X')
			{
				if(s[d][y+2]=='X' and s[d+1][y]=='X' and s[d+1][y+1]=='X' and s[d+1][y+2]!='X' and s[d+2][y]=='X')
					dfs(d,y+1);
				else
					break;
			}
		}
		ans.emplace_back(x,y,d,r);
		for(int i=x;i<=d;i++)s[i][y]=s[i][r]='.';
		for(int j=y;j<=r;j++)s[x][j]=s[d][j]='.';
	};
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(s[i][j]=='X')
			{
				dfs(i,j);
			}
		}
	}
	cout<<ans.size()<<endl;
	for(auto [a,b,c,d]:ans)
	{
		cout<<a<<' '<<b<<' '<<c<<' '<<d<<"\n";
	}
	return 0;
}