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 MAX = 20010;
int n, m;
vector<char> grid(MAX, '.');
vector<int> U(MAX), D(MAX), R(MAX), L(MAX), tU(MAX), tD(MAX), tR(MAX), tL(MAX);
int erase(int x) {
  tD[tU[x]] = tD[x];
  tU[tD[x]] = tU[x];
  tR[tL[x]] = tR[x];
  tL[tR[x]] = tL[x];
  return grid[x] == 'U'   ? tU[x]
         : grid[x] == 'D' ? tD[x]
         : grid[x] == 'L' ? tL[x]
                          : tR[x];
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) cin >> grid[i * (m + 2) + j];
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      int x = i * (m + 2) + j - 1;
      L[x + 1] = (grid[x] != '.') ? x : L[x];
    }
    for (int j = m; j; --j) {
      int x = i * (m + 2) + j + 1;
      R[x - 1] = (grid[x] != '.') ? x : R[x];
    }
  }
  for (int j = 1; j <= m; ++j) {
    for (int i = 1; i <= n; ++i) {
      int x = (i - 1) * (m + 2) + j;
      U[x + m + 2] = (grid[x] != '.') ? x : U[x];
    }
    for (int i = n; i; --i) {
      int x = (i + 1) * (m + 2) + j;
      D[x - m - 2] = (grid[x] != '.') ? x : D[x];
    }
  }
  int ans = 0, cnt = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      int x = i * (m + 2) + j, tans = 0;
      if (grid[x] == '.') continue;
      tU = U, tD = D, tR = R, tL = L;
      while (x) ++tans, x = erase(x);
      if (tans == ans)
        ++cnt;
      else if (tans > ans)
        ans = tans, cnt = 1;
    }
  }
  cout << ans << ' ' << cnt << endl;
  return 0;
}
