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;
int N, M;
map<char, int> Z;
int E[5010][5010], Q[5010];
int U[5010], D[5010], L[5010], R[5010];
char ss[5010];
int dfs(int mm) {
  int nn;
  if (mm == 0) return 0;
  if (Q[mm] == 1)
    nn = U[mm];
  else if (Q[mm] == 2)
    nn = D[mm];
  else if (Q[mm] == 3)
    nn = L[mm];
  else if (Q[mm] == 4)
    nn = R[mm];
  if (L[mm] != 0) R[L[mm]] = R[mm];
  if (R[mm] != 0) L[R[mm]] = L[mm];
  if (D[mm] != 0) U[D[mm]] = U[mm];
  if (U[mm] != 0) D[U[mm]] = D[mm];
  int res = dfs(nn);
  if (L[mm] != 0) R[L[mm]] = mm;
  if (R[mm] != 0) L[R[mm]] = mm;
  if (D[mm] != 0) U[D[mm]] = mm;
  if (U[mm] != 0) D[U[mm]] = mm;
  return res + 1;
}
int main() {
  Z['U'] = 1, Z['D'] = 2, Z['L'] = 3, Z['R'] = 4, Z['.'] = 0;
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= N; i++) {
    scanf("%s", ss + 1);
    for (int j = 1; j <= M; j++) {
      E[i][j] = Z[ss[j]];
      Q[(i - 1) * M + j] = E[i][j];
    }
  }
  memset(U, 0, sizeof(U));
  memset(D, 0, sizeof(D));
  memset(L, 0, sizeof(L));
  memset(R, 0, sizeof(R));
  for (int i = 1; i <= N; i++) {
    int ll = 0, mm;
    for (int j = 1; j <= M; j++)
      if (E[i][j] != 0) {
        mm = (i - 1) * M + j;
        if (ll != 0) L[mm] = ll, R[ll] = mm;
        ll = mm;
      }
  }
  for (int j = 1; j <= M; j++) {
    int uu = 0, mm;
    for (int i = 1; i <= N; i++)
      if (E[i][j] != 0) {
        mm = (i - 1) * M + j;
        if (uu != 0) U[mm] = uu, D[uu] = mm;
        uu = mm;
      }
  }
  int mx = 0, cnt;
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= M; j++)
      if (E[i][j] != 0) {
        int k = dfs((i - 1) * M + j);
        if (k > mx)
          mx = k, cnt = 1;
        else if (k == mx)
          cnt++;
      }
  cout << mx << " " << cnt << endl;
  return 0;
}
