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, res, num;
int R[5010], D[5010], L[5010], U[5010], e;
char mp[5010][5010];
void init() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", mp[i]);
}
int fun(int x, int y) {
  int xx, yy, ans = 0, p, q;
  xx = x;
  yy = y;
  while (1) {
    ans++;
    q = xx * m + yy;
    if (mp[xx][yy] == 'R')
      p = R[q];
    else if (mp[xx][yy] == 'L')
      p = L[q];
    else if (mp[xx][yy] == 'U')
      p = U[q];
    else
      p = D[q];
    L[R[q]] = L[q];
    R[L[q]] = R[q];
    U[D[q]] = U[q];
    D[U[q]] = D[q];
    if (p < 0) return ans;
    xx = p / m;
    yy = p % m;
  }
}
void solve() {
  res = -1, num = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      e = 0;
      for (int k = 0; k < n; k++) {
        for (int l = 0; l < m; l++) {
          R[e] = (l == m - 1 ? -1 : e + 1);
          L[e] = (l == 0 ? -1 : e - 1);
          U[e] = (k == 0 ? -1 : e - m);
          D[e] = (k == n - 1 ? -1 : e + m);
          e++;
        }
      }
      for (int k = 0; k < n; k++) {
        for (int l = 0; l < m; l++) {
          int t = k * m + l;
          if (mp[k][l] == '.') {
            if (R[t] != -1) L[R[t]] = L[t];
            if (L[t] != -1) R[L[t]] = R[t];
            if (D[t] != -1) U[D[t]] = U[t];
            if (U[t] != -1) D[U[t]] = D[t];
          }
        }
      }
      int ans;
      if (mp[i][j] != '.') {
        ans = fun(i, j);
        if (ans > res) {
          res = ans;
          num = 1;
        } else if (ans == res)
          num++;
      }
    }
  }
  printf("%d %d\n", res, num);
}
int main() {
  init();
  solve();
  return 0;
}
