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 = 5000 + 10;
int n, m, ted[maxn], ans = 0;
string s[maxn];
vector<int> l[maxn], r[maxn], u[maxn], d[maxn];
void del(int i, int j) {
  if (r[i][j] != m) l[i][r[i][j]] = l[i][j];
  if (l[i][j] != -1) r[i][l[i][j]] = r[i][j];
  if (u[i][j] != -1) d[u[i][j]][j] = d[i][j];
  if (d[i][j] != n) u[d[i][j]][j] = u[i][j];
}
int f(int i, int j) {
  int ret = 0;
  if (s[i][j] == '.') return ret;
  for (int i1 = 0; i1 < n; i1++)
    for (int j1 = 0; j1 < m; j1++) {
      l[i1][j1] = j1 - 1;
      u[i1][j1] = i1 - 1;
      r[i1][j1] = j1 + 1;
      d[i1][j1] = i1 + 1;
    }
  for (int i1 = 0; i1 < n; i1++)
    for (int j1 = 0; j1 < m; j1++)
      if (s[i1][j1] == '.') del(i1, j1);
  while (true) {
    if (i == -1 || j == -1 || i == n || j == m) break;
    del(i, j);
    if (s[i][j] == 'L')
      j = l[i][j];
    else if (s[i][j] == 'U')
      i = u[i][j];
    else if (s[i][j] == 'R')
      j = r[i][j];
    else
      i = d[i][j];
    ret++;
  }
  return ret;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i < n; i++) {
    l[i].resize(m);
    r[i].resize(m);
    u[i].resize(m);
    d[i].resize(m);
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      int k = f(i, j);
      ted[k]++;
      ans = max(ans, k);
    }
  cout << ans << ' ' << ted[ans] << endl;
  return 0;
}
