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>
char map[5005][5005];
bool r[5005][5005];
int n, m;
int a, b;
void DFS(int x, int y, int l, int f) {
  r[x][y] = false;
  int i;
  if (l > a) {
    a = l;
    b = f;
  }
  switch (map[x][y]) {
    case 'L':
      for (i = y - 1; i >= 0; --i) {
        if (l == 1) f = y - i;
        if (map[x][i] != '.' && r[x][i]) DFS(x, i, l + 1, f);
        break;
      }
      break;
    case 'R':
      for (i = y + 1; i < m; ++i) {
        if (l == 1) f = i - y;
        if (map[x][i] != '.' && r[x][i]) DFS(x, i, l + 1, f);
        break;
      }
      break;
    case 'U':
      for (i = x - 1; i >= 0; --i) {
        if (l == 1) f = x - i;
        if (map[i][y] != '.' && r[i][y]) DFS(i, y, l + 1, f);
        break;
      }
      break;
    case 'D':
      for (i = x + 1; i < n; ++i) {
        if (l == 1) f = i - x;
        if (map[i][y] != '.' && r[i][y]) DFS(i, y, l + 1, f);
        break;
      }
      break;
  }
  r[x][y] = true;
}
int main() {
  int i, j;
  while (scanf("%d%d", &n, &m) != EOF) {
    for (i = 0; i < n; ++i) {
      for (j = 0; j < m; ++j) {
        scanf(" %c", &map[i][j]);
        r[i][j] = true;
      }
    }
    a = -1;
    for (i = 0; i < n; ++i) {
      for (j = 0; j < m; ++j) {
        if (map[i][j] != '.') DFS(i, j, 1, 0);
      }
    }
    printf("%d %d\n", a, b);
  }
  return 0;
}
