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 unsigned long long MOD = 257;
int n, m;
string s[5005];
int L[5005], R[5005], U[5005], D[5005];
void init() {
  int b, pos;
  for (int i = 0; i < n; i++) {
    b = -1;
    for (int j = 0; j < m; j++) {
      if (s[i][j] != '.') {
        pos = i * m + j;
        L[pos] = b;
        if (b != -1) R[b] = pos;
        b = pos;
      }
    }
    R[b] = -1;
  }
  for (int i = 0; i < m; i++) {
    b = -1;
    for (int j = 0; j < n; j++) {
      if (s[j][i] != '.') {
        pos = j * m + i;
        U[pos] = b;
        if (b != -1) {
          D[b] = pos;
        }
        b = pos;
      }
    }
    D[b] = -1;
  }
}
int dfs(int now) {
  int x = now / m, y = now % m;
  if (L[now] != -1) R[L[now]] = R[now];
  if (R[now] != -1) L[R[now]] = L[now];
  if (U[now] != -1) D[U[now]] = D[now];
  if (D[now] != -1) U[D[now]] = U[now];
  int go;
  if (s[x][y] == 'U')
    go = U[now];
  else if (s[x][y] == 'D')
    go = D[now];
  else if (s[x][y] == 'L')
    go = L[now];
  else if (s[x][y] == 'R')
    go = R[now];
  if (go == -1) return 1;
  return dfs(go) + 1;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  int ans = 0, num = 0, tmp;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] != '.') {
        init();
        tmp = dfs(i * m + j);
        if (tmp == ans)
          num++;
        else if (tmp > ans) {
          ans = tmp;
          num = 1;
        }
      }
    }
  }
  cout << ans << " " << num << endl;
}
