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>
const int N = 5005;
int up[N], down[N], left[N], right[N], n, m;
char s[N][N];
void del(int x) {
  if (left[x]) right[left[x]] = right[x];
  if (right[x]) left[right[x]] = left[x];
  if (up[x]) down[up[x]] = down[x];
  if (down[x]) up[down[x]] = up[x];
}
void pushBack(int x) {
  if (left[x]) right[left[x]] = x;
  if (right[x]) left[right[x]] = x;
  if (up[x]) down[up[x]] = x;
  if (down[x]) up[down[x]] = x;
}
int dfs(int row, int col) {
  int ans = 0;
  int k = 0;
  int t = (row - 1) * m + col;
  if (s[row][col] == 'L')
    k = left[t];
  else if (s[row][col] == 'R')
    k = right[t];
  else if (s[row][col] == 'U')
    k = up[t];
  else
    k = down[t];
  if (!k) return 1;
  del(t);
  ans = 1 + dfs((k - 1) / m + 1, (k - 1) % m + 1);
  pushBack(t);
  return ans;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      int t = 0;
      for (int k = i - 1; k && !t; k--)
        if (s[k][j] != '.') t = k;
      if (t) up[(i - 1) * m + j] = (t - 1) * m + j;
      t = 0;
      for (int k = i + 1; k <= n && !t; k++)
        if (s[k][j] != '.') t = k;
      if (t) down[(i - 1) * m + j] = (t - 1) * m + j;
      t = 0;
      for (int k = j - 1; k && !t; k--)
        if (s[i][k] != '.') t = k;
      if (t) left[(i - 1) * m + j] = (i - 1) * m + t;
      t = 0;
      for (int k = j + 1; k <= m && !t; k++)
        if (s[i][k] != '.') t = k;
      if (t) right[(i - 1) * m + j] = (i - 1) * m + t;
    }
  int ans = 1, num = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      if (s[i][j] == '.') continue;
      int tmp = dfs(i, j);
      if (tmp > ans)
        ans = tmp, num = 1;
      else if (tmp == ans)
        num++;
    }
  printf("%d %d", ans, num);
  return 0;
}
