10 10
.L.....R..
.........U
..D....D..
.R......L.
....L.....
.........D
......U...
D....R....
...U......
........L.
 5 5
DD..D
.....
LU...
U...U
.UL.U
 1 1
U
 5 5
UD..L
RRD..
..RDD
UUL..
DDLRR
 19 23
U..U..R........L...D...
.D.....UL.U.U........DR
..D.U..D....L......R...
D.......RL.L....D.....R
U..D.....U...U.L..D...U
...........L...........
U....U....D.U......LRR.
......RL...U...L.......
DLU..U......UU.U.U.D...
...........D....U......
U...DL......LL.....R...
...U..DD..........LD...
.R.........D.....UU...U
....D......R..........D
.L..........R.....L....
.R........L.LL....R....
..R...D........R....D..
.LR.R..LDU.DDRL......U.
...LL.....D.....DD.....
 11 29
URRUUDDLURLRDDLLRLDUDR.UDLLD.
LRRUDLUDLDULUDL.DURDRR.RRLLRR
D.DUDDURLRDDULDUDDUDDURRDLD.L
.RULURURRDLRRRLUUUU.RDLDLRRRL
.RLDDU.UUULUURURRLLUU.RLDRDUD
LRL.URRRDDURUURUDRRDLDDULRDRL
RLULDU.LRDUDRLDLRDDDDRUUDRDLL
DLUDURRDDUDLLDLLUURLDRUURRLUL
L.RRURRDDRRURRRDDUDRRDULR.LUR
LDLRULURRUULRDUUULLU.LLU.LLLL
DUURDULDDUDLRUUDRUULURLD.RL.U
 2 2
RD
UL
 1 10
LLLLLRRRRR
 3 3
...
...
..R
 17 13
...LD.UR.RUU.
LDLULDUDRRDRL
DD.RRLRUR.UD.
RU...D...LD..
.UR.R...URUUD
.RURD.RLR.D.R
.UUU.RU...UR.
UUUU.R.......
RL.LRU.UD.DUD
LD.DRURRLRDRL
.DR..UULUDDR.
LRLURRUUDDLUR
.LRDDLLR.L.DU
DRUDLLD.LRRU.
..DL.UDL.DUL.
U.DL..D..U.RD
RR.R...RL.L..

2 2
 4 1
 1 1
 8 3
 9 1
 94 1
 4 4
 5 2
 1 1
 24 2

#include <bits/stdc++.h>
typedef struct no {
  char c;
  int id;
  int U;
  int D;
  int R;
  int L;
} cel;
cel **map, **mapc;
int n, m, topo = 0;
void imprime(char c) {
  int i, j;
  switch (c) {
    case 'i':
      printf("-------------id-------------\n");
      for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) printf("%d ", map[i][j].id);
        printf("\n");
      }
      printf("----------------------------\n");
      break;
    case 'L':
      printf("-------------L--------------\n");
      for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) printf("%d ", map[i][j].L);
        printf("\n");
      }
      printf("----------------------------\n");
      break;
    case 'c':
      printf("-------------C--------------\n");
      for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) printf("%c ", map[i][j].c);
        printf("\n");
      }
      printf("----------------------------\n");
      break;
  }
}
int main() {
  int atual, i, j;
  scanf("%d %d ", &n, &m);
  map = (cel **)malloc(n * sizeof(cel *));
  for (j = 0; j < m; j++) map[j] = (cel *)malloc(m * sizeof(cel));
  mapc = (cel **)malloc(n * sizeof(cel *));
  for (j = 0; j < m; j++) mapc[j] = (cel *)malloc(m * sizeof(cel));
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      scanf("%c ", &map[i][j].c);
      map[i][j].id = topo;
      if (map[i][j].c != '.') {
        topo++;
      }
    }
  }
  imprime('c');
  imprime('i');
  imprime('L');
  for (i = 0; i < n; i++) {
    atual = -1;
    for (j = 0; j < m; j++) {
      if (map[i][j].c != '.') {
        map[i][j].L = atual;
        atual = map[i][j].id;
      }
    }
  }
  imprime('c');
  imprime('i');
  imprime('L');
  return 0;
}
