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 br[N][N], bc[N][N], n, m;
char s[N][N];
void add(int *bit, int x, int up, int val) {
  while (x <= up) bit[x] += val, x += x & -x;
}
int sum(int *bit, int x) {
  int res = 0;
  while (x) res += bit[x], x -= x & -x;
  return res;
}
int dfs(int row, int col) {
  int l, r, mid, ans = 0;
  if (s[row][col] == 'L') {
    if (!sum(br[row], col - 1)) return 0;
    l = 1, r = col;
    while (r - l > 1) {
      mid = (l + r) >> 1;
      if (sum(br[row], col - 1) - sum(br[row], mid - 1) > 0)
        l = mid;
      else
        r = mid;
    }
    add(br[row], col, m + 1, -1);
    add(bc[col], row, n + 1, -1);
    ans = 1 + dfs(row, l);
    add(br[row], col, m + 1, 1);
    add(bc[col], row, n + 1, 1);
  } else if (s[row][col] == 'R') {
    if (!(sum(br[row], m) - sum(br[row], col))) return 0;
    l = col + 1, r = m;
    while (l < r) {
      mid = (l + r) >> 1;
      if (sum(br[row], mid) - sum(br[row], col) == 0)
        l = mid + 1;
      else
        r = mid;
    }
    add(br[row], col, m + 1, -1);
    add(bc[col], row, n + 1, -1);
    ans = 1 + dfs(row, r);
    add(br[row], col, m + 1, 1);
    add(bc[col], row, n + 1, 1);
  } else if (s[row][col] == 'U') {
    if (!sum(bc[col], row - 1)) return 0;
    l = 1, r = row;
    while (r - l > 1) {
      mid = (l + r) >> 1;
      if (sum(bc[col], row - 1) - sum(bc[col], mid - 1) > 0)
        l = mid;
      else
        r = mid;
    }
    add(br[row], col, m + 1, -1);
    add(bc[col], row, n + 1, -1);
    ans = 1 + dfs(l, col);
    add(br[row], col, m + 1, 1);
    add(bc[col], row, n + 1, 1);
  } else {
    if (!(sum(bc[col], m) - sum(bc[col], row))) return 0;
    l = row + 1, r = n;
    while (l < r) {
      mid = (l + r) >> 1;
      if (sum(bc[col], mid) - sum(bc[col], row) == 0)
        l = mid + 1;
      else
        r = mid;
    }
    add(br[row], col, m + 1, -1);
    add(bc[col], row, n + 1, -1);
    ans = 1 + dfs(r, col);
    add(br[row], col, m + 1, 1);
    add(bc[col], row, n + 1, 1);
  }
  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++) {
      if (s[i][j] == '.') continue;
      add(br[i], j, m + 1, 1);
      add(bc[j], i, n + 1, 1);
    }
  int ans = 0, 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 + 1, num);
  return 0;
}
