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>
short L[5005][5005], R[5005][5005], U[5005][5005], D[5005][5005];
char q[5005][5005];
int n, m, av, aw, sp;
void gao(int x, int y) {
  if (x < 1 || y < 1 || x > m || y > n) return;
  ++sp;
  L[x][R[x][y]] = L[x][y];
  R[x][L[x][y]] = R[x][y];
  U[D[x][y]][y] = U[x][y];
  D[U[x][y]][y] = D[x][y];
  if (q[x][y] == 'L') gao(x, L[x][y]);
  if (q[x][y] == 'R') gao(x, R[x][y]);
  if (q[x][y] == 'U') gao(U[x][y], y);
  if (q[x][y] == 'D') gao(D[x][y], y);
  L[x][R[x][y]] = y;
  R[x][L[x][y]] = y;
  U[D[x][y]][y] = x;
  D[U[x][y]][y] = x;
}
int main() {
  scanf("%d%d", &m, &n);
  for (int i = 1; i <= m; i++) scanf("%s", q[i] + 1);
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++)
      L[i][j] = q[i][j - 1] != '.' ? j - 1 : L[i][j - 1];
    for (int j = n; j > 0; j--)
      R[i][j] = q[i][j + 1] != '.' ? j + 1 : R[i][j + 1];
  }
  for (int j = 1; j <= n; j++) {
    for (int i = 1; i <= m; i++)
      U[i][j] = q[i - 1][j] != '.' ? i - 1 : U[i - 1][j];
    for (int i = m; i > 0; i--)
      D[i][j] = q[i + 1][j] != '.' ? i + 1 : D[i + 1][j];
  }
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      if (q[i][j] != '.') {
        sp = 0;
        gao(i, j);
        if (sp == av)
          ++aw;
        else if (sp > av)
          av = sp, aw = 1;
      }
  printf("%d %d\n", av, aw);
}
