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;
const int maxn = 5005;
int ndx[maxn];
int back[maxn];
int u[maxn], d[maxn], l[maxn], r[maxn];
char str[maxn][maxn];
int n, m;
int bu[maxn], bd[maxn], bl[maxn], br[maxn];
inline void build() {
  int i, j, x;
  for (i = 0; i < n; i++) {
    x = -1;
    for (j = 0; j < m; j++)
      if (str[i][j] != '.') {
        if (x == -1)
          l[ndx[i * m + j]] = -1;
        else
          l[ndx[i * m + j]] = ndx[i * m + x];
        x = j;
      }
    x = -1;
    for (j = m - 1; j >= 0; j--)
      if (str[i][j] != '.') {
        if (x == -1)
          r[ndx[i * m + j]] = -1;
        else
          r[ndx[i * m + j]] = ndx[i * m + x];
        x = j;
      }
  }
  for (j = 0; j < m; j++) {
    x = -1;
    for (i = 0; i < n; i++)
      if (str[i][j] != '.') {
        if (x == -1)
          u[ndx[i * m + j]] = -1;
        else
          u[ndx[i * m + j]] = ndx[x * m + j];
        x = i;
      }
    x = -1;
    for (i = n - 1; i >= 0; i--)
      if (str[i][j] != '.') {
        if (x == -1)
          d[ndx[i * m + j]] = -1;
        else
          d[ndx[i * m + j]] = ndx[x * m + j];
        x = i;
      }
  }
}
inline void remove(int x) {
  if (u[x] != -1) d[u[x]] = d[x];
  if (d[x] != -1) u[d[x]] = u[x];
  if (l[x] != -1) r[l[x]] = r[x];
  if (r[x] != -1) l[r[x]] = l[x];
}
inline int travel(int x) {
  int step = 0;
  int i, j;
  while (x != -1) {
    step++;
    i = back[x] / m;
    j = back[x] % m;
    remove(x);
    switch (str[i][j]) {
      case 'U':
        x = u[x];
        break;
      case 'D':
        x = d[x];
        break;
      case 'L':
        x = l[x];
        break;
      case 'R':
        x = r[x];
        break;
    }
  }
  return step;
}
int main() {
  int i, j, num, ans, tot, t = 0;
  scanf("%d%d", &n, &m);
  for (i = 0; i < n; i++) scanf("%s", str[i]);
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++)
      if (str[i][j] != '.') {
        ndx[i * m + j] = ++t;
        back[t] = i * m + j;
      }
  ans = tot = 0;
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++)
      if (str[i][j] != '.') {
        build();
        num = travel(ndx[i * m + j]);
        if (num > ans) {
          ans = num;
          tot = 1;
        } else if (num == ans)
          tot++;
      }
  printf("%d %d\n", ans, tot);
  return 0;
}
