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, ans, num, mapp[5010], deg[5010];
char str[5005];
void doit(int a, int b) {
  int i, j, k, tmp, step;
  int tmap[5010];
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) tmap[i * m + j] = mapp[i * m + j];
  i = a, j = b;
  step = 0;
  while (i >= 0 && i < n && j >= 0 && j < m) {
    step++;
    tmp = tmap[i * m + j];
    tmap[i * m + j] = 0;
    if (tmp == 1) {
      while (i >= 0 && tmap[i * m + j] == 0) i--;
    } else if (tmp == 2) {
      while (i < n && tmap[i * m + j] == 0) i++;
    } else if (tmp == 3) {
      while (j >= 0 && tmap[i * m + j] == 0) j--;
    } else if (tmp == 4) {
      while (j < m && tmap[i * m + j] == 0) j++;
    }
  }
  if (step > ans) {
    ans = step;
    num = 1;
  } else if (step == ans)
    num++;
}
int main() {
  int i, j;
  scanf("%d%d", &n, &m);
  getchar();
  memset(deg, 0, sizeof(deg));
  for (i = 0; i < n; i++) {
    scanf("%s", str);
    for (j = 0; j < m; j++) {
      if (str[j] == 'U') {
        mapp[i * m + j] = 1;
        if (i - 1 >= 0) deg[(i - 1) * m + j]++;
      } else if (str[j] == 'D') {
        mapp[i * m + j] = 2;
        if (i + 1 < n) deg[(i + 1) * m + j]++;
      } else if (str[j] == 'L') {
        mapp[i * m + j] = 3;
        if (j - 1 >= 0) deg[i * m + j - 1]++;
      } else if (str[j] == 'R') {
        mapp[i * m + j] = 4;
        if (j + 1 < m) deg[i * m + j + 1]++;
      } else if (str[j] == '.')
        mapp[i * m + j] = 0;
    }
  }
  ans = 0;
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++)
      if (mapp[i * m + j] > 0 && deg[i * m + j] == 0) doit(i, j);
  printf("%d %d\n", ans, num);
  return 0;
}
