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 double eps = 1e-8;
const int inf = 0x7f7f7f7f;
const int N = 20000 + 5;
const int mod = 1e9 + 7;
char M[5007][5007];
vector<int> ans;
int L[N], R[N], U[N], D[N], _L[N], _R[N], _U[N], _D[N];
int n, m, flag;
void init() {
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 2); j++) _L[i * (m + 2) + j] = j - 1;
  for (int i = (1); i < (n + 1); i++)
    for (int j = (0); j < (m + 1); j++) _R[i * (m + 2) + j] = j + 1;
  for (int i = (1); i < (n + 2); i++)
    for (int j = (1); j < (m + 1); j++) _U[i * (m + 2) + j] = i - 1;
  for (int i = (0); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++) _D[i * (m + 2) + j] = i + 1;
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++) {
      if (M[i][j] == '.') {
        _L[i * (m + 2) + _R[i * (m + 2) + j]] = _L[i * (m + 2) + j];
        _R[i * (m + 2) + _L[i * (m + 2) + j]] = _R[i * (m + 2) + j];
        _U[_D[i * (m + 2) + j] * (m + 2) + j] = _U[i * (m + 2) + j];
        _D[_U[i * (m + 2) + j] * (m + 2) + j] = _D[i * (m + 2) + j];
      }
    }
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 2); j++)
      L[i * (m + 2) + j] = _L[i * (m + 2) + j];
  for (int i = (1); i < (n + 1); i++)
    for (int j = (0); j < (m + 1); j++)
      R[i * (m + 2) + j] = _R[i * (m + 2) + j];
  for (int i = (1); i < (n + 2); i++)
    for (int j = (1); j < (m + 1); j++)
      U[i * (m + 2) + j] = _U[i * (m + 2) + j];
  for (int i = (0); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++)
      D[i * (m + 2) + j] = _D[i * (m + 2) + j];
}
vector<int> xl, xr, xd, xu;
void gao(int x, int y) {
  int cnt = 0;
  xl.clear();
  xr.clear();
  xd.clear();
  xu.clear();
  while (x && y && x <= n && y <= m) {
    cnt++;
    xl.push_back(x * (m + 2) + R[x * (m + 2) + y]);
    xr.push_back(x * (m + 2) + L[x * (m + 2) + y]);
    xu.push_back(D[x * (m + 2) + y] * (m + 2) + y);
    xd.push_back(U[x * (m + 2) + y] * (m + 2) + y);
    L[x * (m + 2) + R[x * (m + 2) + y]] = L[x * (m + 2) + y];
    R[x * (m + 2) + L[x * (m + 2) + y]] = R[x * (m + 2) + y];
    U[D[x * (m + 2) + y] * (m + 2) + y] = U[x * (m + 2) + y];
    D[U[x * (m + 2) + y] * (m + 2) + y] = D[x * (m + 2) + y];
    if (M[x][y] == 'L') {
      y = L[x * (m + 2) + y];
    } else if (M[x][y] == 'R') {
      y = R[x * (m + 2) + y];
    } else if (M[x][y] == 'U') {
      x = U[x * (m + 2) + y];
    } else if (M[x][y] == 'D') {
      x = D[x * (m + 2) + y];
    }
  }
  if (cnt) ans.push_back(cnt);
  if (1) {
    for (int i = (0); i < (xl.size()); i++) L[xl[i]] = _L[xl[i]];
    for (int i = (0); i < (xr.size()); i++) R[xr[i]] = _R[xr[i]];
    for (int i = (0); i < (xu.size()); i++) U[xu[i]] = _U[xu[i]];
    for (int i = (0); i < (xd.size()); i++) D[xd[i]] = _D[xd[i]];
  }
}
int main() {
  scanf("%d%d", &n, &m);
  memset(M, 0, sizeof(M));
  for (int i = (1); i < (n + 1); i++) scanf("%s", M[i] + 1);
  init();
  long long all = 0;
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++) {
      if (M[i][j] != '.') gao(i, j);
      all += flag;
    }
  sort(ans.begin(), ans.end());
  int mx = ans[(int)ans.size() - 1];
  printf("%d %d\n", mx,
         (int)ans.size() -
             (lower_bound(ans.begin(), ans.end(), mx) - ans.begin()));
}
