#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x<<1) + (x<<3) + ch - '0';
        ch = getchar();
    }
    return x * f;
}
int n,m,ans[4][1001][1001],k,x,y,xx,yy;
pair<int,int>st[61],ed[61];
char c[1001][1001];
signed main()
{
    n = read(), m = read();
    for(int i = 1; i <= n; i++)
        scanf("%s", c[i] + 1);
    if(n<=60&&m<=60)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(c[i][j]=='X')
                {
                    k++;
                }
            }
        }
        for(int i=1;i<=k;i++)
        {
            x=read(),y=read();
            st[i]={x,y};
            xx=read(),yy=read();
            ed[i]={xx,yy};
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                puts("genshin");
            }
        }
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                ans[0][i][j]=-1;
                ans[1][i][j]=-1;
                ans[2][i][j]=-1;
                ans[3][i][j]=-1;
                if(c[i][j]=='.')
                {
                    ans[0][i][j]=0;
                    ans[1][i][j]=0;
                    ans[2][i][j]=0;
                    ans[3][i][j]=0;
                    for(int k=i;k>=1;k--)
                    {
                        if(c[k][j]=='#')
                            break;
                        ans[0][i][j]++;
                    }
                    for(int k=i;k<=n;k++)
                    {
                        if(c[k][j]=='#')
                            break;
                        ans[1][i][j]++;
                    }
                    for(int k=j;k>=1;k--)
                    {
                        if(c[i][k]=='#')
                            break;
                        ans[2][i][j]++;
                    }
                    for(int k=j;k<=m;k++)
                    {
                        if(c[i][k]=='#')
                            break;
                        ans[3][i][j]++;
                    }
                }
            }
        }
        for(int i=0;i<=3;i++)
        {
            for(int j=1;j<=n;j++)
            {
                for(int k=1;k<=m;k++)
                    printf("%lld ",ans[i][j][k]);
                printf("\n");
            }
        }
    }
    return 0;
}