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>
using namespace std;
int n, m;
char s[5001][5001];
int p[5001][5001];
int a[5001][4], A[5001][4];
int d[5001];
int dis, num;
int main() {
  int nn = 0;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", s[i]);
  memset(a, 0, sizeof(a));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] != '.') {
        p[i][j] = ++nn;
        if (s[i][j] == 'U') d[nn] = 0;
        if (s[i][j] == 'D') d[nn] = 1;
        if (s[i][j] == 'L') d[nn] = 2;
        if (s[i][j] == 'R') d[nn] = 3;
      } else
        p[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (p[i][j]) {
        for (int k = i - 1; k >= 0; k--) {
          if (p[k][j]) {
            a[p[i][j]][0] = p[k][j];
            break;
          }
        }
        for (int k = i + 1; k < n; k++) {
          if (p[k][j]) {
            a[p[i][j]][1] = p[k][j];
            break;
          }
        }
        for (int k = j - 1; k >= 0; k--) {
          if (p[i][k]) {
            a[p[i][j]][2] = p[i][k];
            break;
          }
        }
        for (int k = j + 1; k < m; k++) {
          if (p[i][k]) {
            a[p[i][j]][3] = p[i][k];
            break;
          }
        }
      }
    }
  }
  dis = 0;
  num = 0;
  for (int i = 1; i <= nn; i++) {
    memcpy(A, a, sizeof(a));
    int j = i;
    int length = 0;
    while (j) {
      length++;
      A[A[j][0]][1] = A[j][1];
      A[A[j][1]][0] = A[j][0];
      A[A[j][2]][3] = A[j][3];
      A[A[j][3]][2] = A[j][2];
      j = A[j][d[j]];
    }
    if (dis < length) {
      dis = length;
      num = 1;
    } else if (dis == length)
      num++;
  }
  printf("%d %d\n", dis, num);
  return 0;
}
