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;
string g[(10000)], f[(10000)];
vector<int> U[(10000)], L[(10000)], R[(10000)], D[(10000)];
int cnt, ans, n, m, tot;
void bfs(int x, int y, int c, char t) {
  while (true) {
    if (x < 0 || x >= m || y < 0 || y >= n) {
      if (c > ans)
        ans = c, cnt = 1;
      else {
        if (c == ans) cnt++;
      }
      break;
    }
    if (f[x][y] != '.') t = f[x][y], c++;
    f[x][y] = '.';
    if (R[x][y] != n) L[x][R[x][y]] = L[x][y];
    if (L[x][y] != -1) R[x][L[x][y]] = R[x][y];
    if (D[x][y] != m) U[x][D[x][y]] = U[x][y];
    if (U[x][y] != -1) D[x][U[x][y]] = D[x][y];
    if (t == 'L') y = L[x][y];
    if (t == 'R') y = R[x][y];
    if (t == 'U') x = U[x][y];
    if (t == 'D') x = D[x][y];
  }
}
void refresh() {
  for (int i = 0; i < m; i++) f[i] = g[i];
  for (int i = 0; i < m; i++) {
    int now = -1;
    for (int j = 0; j < n; j++) {
      L[i][j] = now;
      if (g[i][j] != '.') now = j;
    }
  }
  for (int i = 0; i < m; i++) {
    int now = n;
    for (int j = n - 1; j >= 0; j--) {
      R[i][j] = now;
      if (g[i][j] != '.') now = j;
    }
  }
  for (int j = 0; j < n; j++) {
    int now = -1;
    for (int i = 0; i < m; i++) {
      U[i][j] = now;
      if (g[i][j] != '.') now = i;
    }
  }
  for (int j = 0; j < n; j++) {
    int now = m;
    for (int i = m - 1; i >= 0; i--) {
      D[i][j] = now;
      if (g[i][j] != '.') now = i;
    }
  }
}
int main() {
  scanf("%d%d", &m, &n);
  for (int i = 0; i < m; i++) cin >> g[i];
  for (int i = 0; i < m; i++)
    for (int j = 0; j < n; j++)
      L[i].push_back(0), R[i].push_back(0), U[i].push_back(0),
          D[i].push_back(0);
  ans = cnt = -1;
  for (int i = 0; i < m; i++)
    for (int j = 0; j < n; j++)
      if (g[i][j] != '.') {
        refresh();
        bfs(i, j, 0, g[i][j]);
      }
  printf("%d %d\n", ans, cnt);
  return 0;
}
