#include<bits/stdc++.h>
using namespace std;
const int Max=1005;
int tx[8]={0,-1,1,0,0},ty[8]={0,0,0,-1,1};
int Map[Max][Max][5],to[Max][Max][2];
bool vis[Max][Max];
char c[Max][Max];
int n,m;
char getc()
{
	char c=getchar();
	while(c!='.' and c!='#' and c!='/' and c!='\\' and c!='X')
		c=getchar();
	return c;
}
int dfs(int x,int y,int tow)
{
	int ans=0;
	if(Map[x][y][tow])
		return ans;
	if(!vis[x][y])
		ans++;
	vis[x][y]=1;
	Map[x][y][tow]=1;
	if(c[x][y]=='\\')
		tow=(tow+1)%4+1;
	else if(c[x][y]=='/')
	{
		if(tow==1)tow=4;
		else if(tow==4)tow=1;
		else if(tow==2)tow=3;
		else if(tow==3)tow=2;
	}
	int nx=x+tx[tow],ny=y+ty[tow];
	if(nx<1 or nx>n or ny<1 or ny>m or c[nx][ny]=='#')
		return ans;
	if(c[nx][ny]=='X')
	{
		if(!vis[nx][ny])
		{
			vis[nx][ny]=1;
			ans++;
		}
		x=nx;y=ny;
		nx=to[x][y][0];
		ny=to[x][y][1];
	}
	ans+=dfs(nx,ny,tow);
	return ans;
}
void clear()
{
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			vis[i][j]=0;
			for(int k=1;k<=4;k++)
				Map[i][j][k]=0;
		}
	}
}
void solve1()
{
	for(int k=1;k<=4;k++)
	{
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				if(c[i][j]=='.')
				{
					clear();
					printf("%d ",dfs(i,j,k));
				}
				else
					printf("-1 ");
			}
			printf("\n");
		}
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	int k=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			c[i][j]=getc();
			if(c[i][j]=='X')
				k++;
		}
	}
	int X1,X2,Y1,Y2;
	for(int i=1;i<=k/2;i++)
	{
		scanf("%d%d%d%d",&X1,&Y1,&X2,&Y2);
		to[X1][Y1][0]=X2;
		to[X1][Y1][1]=Y2;
		to[X2][Y2][0]=X1;
		to[X2][Y2][1]=Y1;
	}
	if(n<=60 and m<=60)
		solve1();
	
}