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>
long lal[5005] = {0}, lar[5005] = {0}, lau[5005] = {0}, lad[5005] = {0},
     lastl[5005] = {0}, lastr[5005] = {0}, lastu[5005] = {0}, lastd[5005] = {0};
long num[5005][5005] = {0};
char c[5005][5005] = {'\0'};
int main() {
  long i, j, n, m, x, y, tx, ty, ans = 0, count, tot = 0, ansi, la;
  scanf("%ld %ld\n", &n, &m);
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      scanf("%c", &c[i][j]);
      num[i][j] = ++tot;
    }
    scanf("\n");
  }
  for (i = 1; i <= n; i++)
    for (j = 1, la = 0; j <= m; j++) {
      lastl[num[i][j]] = la;
      if (c[i][j] != '.') la = j;
    }
  for (i = 1; i <= n; i++)
    for (j = m, la = 0; j >= 1; j--) {
      lastr[num[i][j]] = la;
      if (c[i][j] != '.') la = j;
    }
  for (j = 1; j <= m; j++)
    for (i = 1, la = 0; i <= n; i++) {
      lastu[num[i][j]] = la;
      if (c[i][j] != '.') la = i;
    }
  for (j = 1; j <= m; j++)
    for (i = n, la = 0; i >= 1; i--) {
      lastd[num[i][j]] = la;
      if (c[i][j] != '.') la = i;
    }
  for (x = 1; x <= n; x++)
    for (y = 1; y <= m; y++)
      if (c[x][y] != '.') {
        count = 0;
        for (i = 1; i <= n; i++)
          for (j = 1; j <= m; j++) {
            lal[num[i][j]] = lastl[num[i][j]];
            lar[num[i][j]] = lastr[num[i][j]];
            lau[num[i][j]] = lastu[num[i][j]];
            lad[num[i][j]] = lastd[num[i][j]];
          }
        tx = x;
        ty = y;
        if (tx == 3 && ty == 3) i = 1;
        while (1) {
          lal[num[tx][lar[num[tx][ty]]]] = lal[num[tx][ty]];
          lar[num[tx][lal[num[tx][ty]]]] = lar[num[tx][ty]];
          lau[num[lad[num[tx][ty]]][ty]] = lau[num[tx][ty]];
          lad[num[lau[num[tx][ty]]][ty]] = lad[num[tx][ty]];
          count++;
          if (c[tx][ty] == 'L') {
            if (lal[num[tx][ty]] == 0) break;
            ty = lal[num[tx][ty]];
          } else if (c[tx][ty] == 'R') {
            if (lar[num[tx][ty]] == 0) break;
            ty = lar[num[tx][ty]];
          } else if (c[tx][ty] == 'U') {
            if (lau[num[tx][ty]] == 0) break;
            tx = lau[num[tx][ty]];
          } else if (c[tx][ty] == 'D') {
            if (lad[num[tx][ty]] == 0) break;
            tx = lad[num[tx][ty]];
          }
        }
        if (count > ans) {
          ans = count;
          ansi = 1;
        } else if (count == ans)
          ansi++;
      }
  printf("%ld %ld\n", ans, ansi);
  return 0;
}
