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 main() {
  int n, m;
  string ss;
  vector<string> s;
  cin >> n >> m;
  bool anda = false;
  for (int i = 0; i < n; i++) {
    cin >> ss;
    s.push_back(ss);
  }
  bool fl;
  int count = 0;
  vector<int> uans;
  int sc, ans = 0;
  double in = clock();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      vector<string> t = s;
      fl = true;
      int p = i, q = j;
      sc = 0;
      if (t[p][q] != '.') {
        sc = 1;
        while (fl) {
          if (t[p][q] == 'U') {
            t[p][q] = '.';
            p--;
            while (p >= 0 && t[p][q] == '.') p--;
            if (p < 0) {
              fl = false;
              break;
            } else
              sc++;
          }
          if (t[p][q] == 'D') {
            t[p][q] = '.';
            p++;
            while (p <= n - 1 && t[p][q] == '.') p++;
            if (p > n - 1) {
              fl = false;
              break;
            } else
              sc++;
          }
          if (t[p][q] == 'L') {
            t[p][q] = '.';
            q--;
            while (q >= 0 && t[p][q] == '.') q--;
            if (q < 0) {
              fl = false;
              break;
            } else
              sc++;
          }
          if (t[p][q] == 'R') {
            t[p][q] = '.';
            q++;
            while (q <= m - 1 && t[p][q] == '.') q++;
            if (q > m - 1) {
              fl = false;
              break;
            } else
              sc++;
          }
        }
      }
      if ((clock() - in) / (double)CLOCKS_PER_SEC > 3.7) break;
      if (sc >= ans) {
        ans = sc;
        uans.push_back(sc);
      }
    }
  }
  sort(uans.begin(), uans.end());
  reverse(uans.begin(), uans.end());
  if (uans.size() > 0) ans = uans[0];
  int c = 0;
  for (int i = 0; i < uans.size(); i++) {
    if (ans == uans[i]) c++;
  }
  cout << ans << " " << c;
  cin >> ans;
  return 0;
}
