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 = 10000;
char DP[maxN][maxN];
int nr, nc;
int L[maxN], R[maxN];
int U[maxN], D[maxN];
void getUDLR() {
  for (int i = 0; i < nr; i++) {
    int l = -1;
    for (int j = 0; j < nc; j++)
      if (DP[i][j] != '.') {
        int idx = i * nc + j;
        L[idx] = l;
        if (l != -1) R[l] = idx;
        l = idx;
      }
    R[l] = -1;
  }
  for (int i = 0; i < nc; i++) {
    int u = -1;
    for (int j = 0; j < nr; j++)
      if (DP[j][i] != '.') {
        int idx = j * nc + i;
        U[idx] = u;
        if (u != -1) D[u] = idx;
        u = idx;
      }
    D[u] = -1;
  }
}
void del(int i, int j) {
  int idx = i * nc + j;
  if (U[idx] != -1) D[U[idx]] = D[idx];
  if (D[idx] != -1) U[D[idx]] = U[idx];
  if (L[idx] != -1) R[L[idx]] = R[idx];
  if (R[idx] != -1) L[R[idx]] = L[idx];
}
int dfs(int i, int j) {
  del(i, j);
  int idx = i * nc + j;
  if (DP[i][j] == 'U') {
    if (U[idx] == -1)
      return 1;
    else
      return 1 + dfs(U[idx] / nc, j);
  } else if (DP[i][j] == 'D') {
    if (D[idx] == -1)
      return 1;
    else
      return 1 + dfs(D[idx] / nc, j);
  } else if (DP[i][j] == 'L') {
    if (L[idx] == -1)
      return 1;
    else
      return 1 + dfs(i, L[idx] % nc);
  } else if (DP[i][j] == 'R') {
    if (R[idx] == -1)
      return 1;
    else
      return 1 + dfs(i, R[idx] % nc);
  }
}
int main() {
  scanf("%d %d", &nr, &nc);
  for (int i = 0; i < nr; i++) scanf("%s", DP[i]);
  int num, max = -1;
  for (int i = 0; i < nr; i++)
    for (int j = 0; j < nc; j++)
      if (DP[i][j] != '.') {
        getUDLR();
        int tmp = dfs(i, j);
        if (tmp > max)
          max = tmp, num = 1;
        else if (tmp == max)
          num++;
      }
  printf("%d %d\n", max, num);
  return 0;
}
