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;
inline int SG(double x) { return x > -1E-8 ? x < 1E-8 ? 0 : 1 : -1; }
string str[6000];
int h[6000];
vector<int> L[6000];
vector<int> R[6000];
vector<int> D[6000];
vector<int> U[6000];
int maxd, dct;
inline void K(int x, int y) {
  if (R[x][y] != -1) L[x][R[x][y]] = L[x][y];
  if (L[x][y] != -1) R[x][L[x][y]] = R[x][y];
  if (U[x][y] != -1) D[U[x][y]][y] = D[x][y];
  if (D[x][y] != -1) U[D[x][y]][y] = U[x][y];
}
inline void H(int x, int y) {
  if (R[x][y] != -1) L[x][R[x][y]] = y;
  if (L[x][y] != -1) R[x][L[x][y]] = y;
  if (U[x][y] != -1) D[U[x][y]][y] = x;
  if (D[x][y] != -1) U[D[x][y]][y] = x;
}
void dfs(int x, int y, int d) {
  if (x == -1 || y == -1) {
    if (d > maxd) {
      maxd = d;
      dct = 1;
    } else if (d == maxd) {
      dct++;
    }
    return;
  }
  K(x, y);
  if (str[x][y] == 'L') {
    dfs(x, L[x][y], d + 1);
  } else if (str[x][y] == 'R') {
    dfs(x, R[x][y], d + 1);
  } else if (str[x][y] == 'D') {
    dfs(D[x][y], y, d + 1);
  } else {
    dfs(U[x][y], y, d + 1);
  }
  H(x, y);
}
int main() {
  int n, m, i, j, k;
  scanf("%d %d", &n, &m);
  for (i = 0; i < n; i++) {
    cin >> str[i];
  }
  for (j = 0; j < m; j++) {
    h[j] = -1;
  }
  for (i = 0; i < n; i++) {
    L[i].resize(m);
    R[i].resize(m);
    D[i].resize(m);
    U[i].resize(m);
  }
  for (i = 0; i < n; i++) {
    k = -1;
    for (j = 0; j < m; j++) {
      if (str[i][j] != '.') {
        L[i][j] = k;
        if (k != -1) R[i][k] = j;
        U[i][j] = h[j];
        if (h[j] != -1) D[h[j]][j] = i;
        k = j;
        h[j] = i;
      }
    }
    if (k != -1) R[i][k] = -1;
  }
  for (j = 0; j < m; j++) {
    if (h[j] != -1) D[h[j]][j] = -1;
  }
  maxd = -1;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      if (str[i][j] != '.') {
        dfs(i, j, 0);
      }
    }
  }
  printf("%d %d\n", maxd, dct);
  return 0;
}
