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;
char a[maxn][maxn];
short l[maxn][maxn], r[maxn][maxn], d[maxn][maxn], u[maxn][maxn];
int m, n;
int tmp;
void hide(int x, int y) {
  l[x][r[x][y]] = l[x][y];
  r[x][l[x][y]] = r[x][y];
  d[u[x][y]][y] = d[x][y];
  u[d[x][y]][y] = u[x][y];
}
void show(int x, int y) {
  l[x][r[x][y]] = y;
  r[x][l[x][y]] = y;
  d[u[x][y]][y] = x;
  u[d[x][y]][y] = x;
}
void dfs(int i, int j) {
  if (i == 0 || j == 0) return;
  ++tmp;
  hide(i, j);
  if (a[i][j] == 'L') dfs(i, l[i][j]);
  if (a[i][j] == 'R') dfs(i, r[i][j]);
  if (a[i][j] == 'D') dfs(d[i][j], j);
  if (a[i][j] == 'U') dfs(u[i][j], j);
  show(i, j);
}
int main() {
  scanf("%d%d", &m, &n);
  for (int i = 1; i <= m; ++i) scanf("%s", a[i] + 1);
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (j > 1 && a[i][j - 1] != '.')
        l[i][j] = j - 1;
      else
        l[i][j] = l[i][j - 1];
      if (i > 1 && a[i][j] != '.')
        u[i][j] = i - 1;
      else
        u[i][j] = u[i - 1][j];
    }
  }
  for (int i = m; i > 0; --i) {
    for (int j = n; j > 0; --j) {
      if (j < n && a[i][j + 1] != '.')
        r[i][j] = j + 1;
      else
        r[i][j] = r[i][j + 1];
      if (i < m && a[i + 1][j] != '.')
        d[i][j] = i + 1;
      else
        d[i][j] = d[i + 1][j];
    }
  }
  int ans = 0, cnt = 0;
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= n; ++j)
      if (a[i][j] != '.') {
        tmp = 0;
        dfs(i, j);
        if (tmp > ans)
          ans = tmp, cnt = 1;
        else if (tmp == ans)
          ++cnt;
      }
  }
  printf("%d %d", ans, cnt);
  return 0;
}
