#include <bits/stdc++.h>
#define inf INT_MAX
#define NN INT_MIN
typedef long long ll;
using namespace std;
int a[1005][1005], ans[1005][1005];
int n, m, k;
int main()
{
#ifdef WHX_AK_IOI
   freopen("data.in", "r", stdin);
// freopen("dataout.txt","w",stdout);
#endif
   ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
   cin >> n >> m;
   for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++)
      {
         char c;
         cin >> c;
         if (c == '/')
         {
            cout << "gxhakioi" << endl;
            return 0;
         }
         if (c == 'X')
            a[i][j] = 1;
      }
   // cin >> k;
   // if (k != 0)
   // {
   //    cout << "gxhakioi" << endl;
   //    return 0;
   // }
   for (int j = 1; j <= m; j++)
   {
      int pre = 0;
      for (int i = 1; i <= n; i++)
      {
         if (a[i][j] == 1)
         {
            ans[i][j] = -1;
            pre = 0;
            continue;
         }
         ans[i][j] = pre + 1;
         pre = ans[i][j];
      }
   }
   for (int i = 1; i <= n; i++)
   {
      for (int j = 1; j <= m; j++)
         cout << ans[i][j] << ' ';
      cout << endl;
   }

   memset(ans, 0, sizeof ans);
   for (int j = 1; j <= m; j++)
   {
      int pre = 0;
      for (int i = n; i >= 1; i--)
      {
         if (a[i][j] == 1)
         {
            ans[i][j] = -1;
            pre = 0;
            continue;
         }
         ans[i][j] = pre + 1;
         pre = ans[i][j];
      }
   }
   for (int i = 1; i <= n; i++)
   {
      for (int j = 1; j <= m; j++)
         cout << ans[i][j] << ' ';
      cout << endl;
   }

   memset(ans, 0, sizeof ans);
   for (int i = 1; i <= n; i++)
   {
      int pre = 0;
      for (int j = m; j >= 1; j--)
      {
         if (a[i][j] == 1)
         {
            ans[i][j] = -1;
            pre = 0;
            continue;
         }
         ans[i][j] = pre + 1;
         pre = ans[i][j];
      }
   }
   for (int i = 1; i <= n; i++)
   {
      for (int j = 1; j <= m; j++)
         cout << ans[i][j] << ' ';
      cout << endl;
   }

   memset(ans, 0, sizeof ans);
   for (int i = 1; i <= n; i++)
   {
      int pre = 0;
      for (int j = 1; j <= m; j++)
      {
         if (a[i][j] == 1)
         {
            ans[i][j] = -1;
            pre = 0;
            continue;
         }
         ans[i][j] = pre + 1;
         pre = ans[i][j];
      }
   }
   for (int i = 1; i <= n; i++)
   {
      for (int j = 1; j <= m; j++)
         cout << ans[i][j] << ' ';
      cout << endl;
   }
   // system("pause");
   return 0;
}