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 up[10010], dw[10010], rt[10010], lt[10010];
int upp[10010], dww[10010], rtt[10010], ltt[10010];
char mp[5005][5005];
int n, m;
void init() {
  int i, j, k;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= m; j++) {
      up[i * m + j] = upp[i * m + j];
      dw[i * m + j] = dww[i * m + j];
      rt[i * m + j] = rtt[i * m + j];
      lt[i * m + j] = ltt[i * m + j];
    }
}
void delet(int k) {
  if (dw[k] > 0) up[dw[k]] = up[k];
  if (up[k] > 0) dw[up[k]] = dw[k];
  if (rt[k] > 0) lt[rt[k]] = lt[k];
  if (lt[k] > 0) rt[lt[k]] = rt[k];
}
int main() {
  int i, j, k;
  int len, ans, num;
  while (scanf("%d%d", &n, &m) != EOF) {
    for (i = 1; i <= n; i++) {
      scanf("%s", &mp[i][1]);
    }
    memset(up, -1, sizeof(up));
    memset(dw, -1, sizeof(dw));
    memset(rt, -1, sizeof(rt));
    memset(lt, -1, sizeof(lt));
    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++) {
        for (k = i - 1; k >= 1; k--)
          if (mp[k][j] != '.') {
            up[i * m + j] = k * m + j;
            break;
          }
        for (k = i + 1; k <= n; k++)
          if (mp[k][j] != '.') {
            dw[i * m + j] = k * m + j;
            break;
          }
        for (k = j - 1; k >= 1; k--)
          if (mp[i][k] != '.') {
            lt[i * m + j] = i * m + k;
            break;
          }
        for (k = j + 1; k <= m; k++)
          if (mp[i][k] != '.') {
            rt[i * m + j] = i * m + k;
            break;
          }
      }
    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++) {
        upp[i * m + j] = up[i * m + j];
        dww[i * m + j] = dw[i * m + j];
        rtt[i * m + j] = rt[i * m + j];
        ltt[i * m + j] = lt[i * m + j];
      }
    ans = 0;
    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++) {
        if (mp[i][j] == '.') continue;
        len = 0;
        init();
        int x = i, y = j;
        while (1) {
          k = x * m + y;
          len++;
          if (mp[x][y] == 'U' && up[k] > 0)
            x = up[k] / m;
          else if (mp[x][y] == 'D' && dw[k] > 0)
            x = dw[k] / m;
          else if (mp[x][y] == 'L' && lt[k] > 0)
            y = lt[k] % m;
          else if (mp[x][y] == 'R' && rt[k] > 0)
            y = rt[k] % m;
          else
            break;
          if (y == m) x--;
          if (y == 0) y = m;
          delet(k);
        }
        if (len > ans) {
          ans = len;
          num = 1;
        } else if (len == ans)
          num++;
      }
    printf("%d %d\n", ans, num);
  }
  return 0;
}
