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;
char ch[10005];
char chcp[10005];
int dpr[10005][4];
int dpc[10005][4];
int row, col;
int arah[2000];
int dr[] = {0, 1, 0, -1};
int dc[] = {1, 0, -1, 0};
char buffer[10500];
bool inside(int r, int c) { return r >= 0 && r < row && c >= 0 && c < col; }
pair<int, int> move(int r, int c, int arah) {
  if (!inside(r, c)) return make_pair(r, c);
  if (chcp[r * col + c] != '.') return make_pair(r, c);
  if (dpr[r * col + c][arah] == -10) {
    dpr[r * col + c][arah] = r + dr[arah];
    dpc[r * col + c][arah] = c + dc[arah];
  }
  pair<int, int> hasil =
      move(dpr[r * col + c][arah], dpc[r * col + c][arah], arah);
  dpr[r * col + c][arah] = hasil.first;
  dpc[r * col + c][arah] = hasil.second;
  return hasil;
}
int main() {
  arah['R'] = 0;
  arah['D'] = 1;
  arah['L'] = 2;
  arah['U'] = 3;
  scanf("%d%d\n", &row, &col);
  int best = 0;
  int ret = 0;
  for (int(i) = 0; (i) < (row); ++(i)) {
    scanf("%s\n", buffer);
    for (int j = i * col; j < (i + 1) * col; ++j) ch[j] = buffer[j - i * col];
  }
  for (int(ir) = 0; (ir) < (row); ++(ir))
    for (int(ic) = 0; (ic) < (col); ++(ic))
      if (ch[ir * col + ic] != '.') {
        for (int(r) = 0; (r) < (row * col); ++(r))
          for (int(d) = 0; (d) < (4); ++(d)) dpr[r][d] = dpc[r][d] = -10;
        for (int(r) = 0; (r) < (row * col); ++(r)) chcp[r] = ch[r];
        int moves = 0;
        int r = ir, c = ic;
        while (inside(r, c)) {
          ++moves;
          int a = arah[(int)chcp[r * col + c]];
          chcp[r * col + c] = '.';
          pair<int, int> p = move(r, c, a);
          r = p.first;
          c = p.second;
        }
        if (moves > best) {
          best = moves;
          ret = 0;
        }
        if (moves == best) ++ret;
      }
  cout << best << " " << ret << endl;
  return 0;
}
