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 input1[5005][5005], input2[5005][5005];
int sign[5005][5005];
int m, n, tem;
void search(int i, int j) {
  int k;
  if (input2[i][j] == 'L') {
    for (k = j - 1; k >= 0; k--)
      if (input2[i][k] == '.')
        ;
      else {
        tem++;
        input2[i][j] = '.';
        search(i, k);
        return;
      }
    if (k == -1) {
      tem++;
      return;
    }
  } else if (input2[i][j] == 'R') {
    for (k = j + 1; k < n; k++)
      if (input2[i][k] == '.')
        ;
      else {
        tem++;
        input2[i][j] = '.';
        search(i, k);
        return;
      }
    if (k == n) {
      tem++;
      return;
    }
  } else if (input2[i][j] == 'U') {
    for (k = i - 1; k >= 0; k--)
      if (input2[k][j] == '.')
        ;
      else {
        tem++;
        input2[i][j] = '.';
        search(k, j);
        return;
      }
    if (k == -1) {
      tem++;
      return;
    }
  } else if (input2[i][j] == 'D') {
    for (k = i + 1; k < m; k++)
      if (input2[k][j] == '.')
        ;
      else {
        tem++;
        input2[i][j] = '.';
        search(k, j);
        return;
      }
    if (k == m) {
      tem++;
      return;
    }
  }
}
int main() {
  int i, j, max, sum, p, q, k;
  while (scanf("%d %d", &m, &n) == 2) {
    for (i = 0; i <= m; i++)
      for (j = 0; j <= n; j++) sign[i][j] = 0;
    for (i = 0; i < m; i++) {
      for (j = 0; j < n; j++) scanf("%c", &input1[i][j]);
    }
    max = 0;
    sum = 0;
    for (i = 0; i < m; i++)
      for (j = 0; j < n; j++) {
        if (input1[i][j] != '.' && sign[i][j] == 0) {
          tem = 0;
          sign[i][j] = 1;
          for (p = 0; p < m; p++)
            for (q = 0; q <= n; q++) input2[p][q] = input1[p][q];
          search(i, j);
          if (input1[i][j] == 'L' || input1[i][j] == 'R') {
            for (k = 0; k < n; k++)
              if (k != j)
                if (input1[i][k] == 'U' || input1[i][k] == 'D') sign[i][k] = 1;
          } else if (input1[i][j] == 'U' || input1[i][j] == 'D') {
            for (k = 0; k < m; k++)
              if (k != i)
                if (input1[k][j] == 'L' || input1[k][j] == 'R') sign[k][j] = 1;
          }
          if (tem == max) {
            sum++;
          } else if (tem > max) {
            max = tem;
            sum = 1;
          }
        }
      }
    printf("%d %d\n", max, sum);
  }
}
