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 long long M = 5005;
char maze[M][M];
int n, m;
int U[M], D[M], L[M], R[M];
void getUDLR() {
  for (int i = 0; i < n; i++) {
    int l = -1;
    for (int j = 0; j < m; j++) {
      if (maze[i][j] != '.') {
        int index = i * m + j;
        L[index] = l;
        if (l != -1) R[l] = index;
        l = index;
      }
    }
    R[l] = -1;
  }
  for (int j = 0; j < m; j++) {
    int u = -1;
    for (int i = 0; i < n; i++) {
      if (maze[i][j] != '.') {
        int index = i * m + j;
        U[index] = u;
        if (u != -1) D[u] = index;
        u = index;
      }
    }
    D[u] = -1;
  }
}
void Delete(int x, int y) {
  int index = x * m + y;
  if (U[index] != -1) D[U[index]] = D[index];
  if (D[index] != -1) U[D[index]] = U[index];
  if (L[index] != -1) R[L[index]] = R[index];
  if (R[index] != -1) L[R[index]] = L[index];
}
int dfs(int x, int y) {
  Delete(x, y);
  int index = x * m + y;
  switch (maze[x][y]) {
    case 'U':
      if (U[index] == -1)
        return 1;
      else
        return 1 + dfs(U[index] / m, y);
      break;
    case 'D':
      if (D[index] == -1)
        return 1;
      else
        return 1 + dfs(D[index] / m, y);
      break;
    case 'L':
      if (L[index] == -1)
        return 1;
      else
        return 1 + dfs(x, L[index] % m);
      break;
    case 'R':
      if (R[index] == -1)
        return 1;
      else
        return 1 + dfs(x, R[index] % m);
      break;
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", maze[i]);
  int maxV = -1, num = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (maze[i][j] != '.') {
        getUDLR();
        int res = dfs(i, j);
        if (res > maxV) {
          maxV = res;
          num = 1;
        } else if (res == maxV) {
          num++;
        }
      }
    }
  }
  printf("%d %d\n", maxV, num);
  return 0;
}
