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;
vector<vector<vector<pair<int, int> > > > nextCell, fNextCell;
vector<vector<int> > a;
vector<vector<bool> > vis;
pair<int, int> findnextCell(int x, int y, int d) {
  pair<int, int> st = nextCell[x][y][d];
  if (st != make_pair(-1, -1) &&
      (vis[st.first][st.second] || a[st.first][st.second] == -1))
    nextCell[x][y][d] = findnextCell(st.first, st.second, d);
  return nextCell[x][y][d];
}
int main() {
  ios_base::sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  a.resize(n, vector<int>(m, -1));
  char c;
  for (int i = 0; i < n; i++) {
    cin.ignore();
    for (int j = 0; j < m; j++) {
      cin.get(c);
      if (c == 'L') a[i][j] = 0;
      if (c == 'R') a[i][j] = 1;
      if (c == 'U') a[i][j] = 2;
      if (c == 'D') a[i][j] = 3;
    }
  }
  nextCell.resize(n, vector<vector<pair<int, int> > >(
                         m, vector<pair<int, int> >(4, make_pair(-1, -1))));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (j != 0) nextCell[i][j][0] = {i, j - 1};
      if (j != m - 1) nextCell[i][j][1] = {i, j + 1};
      if (i != 0) nextCell[i][j][2] = {i - 1, j};
      if (i != n - 1) nextCell[i][j][3] = {i + 1, j};
    }
  }
  fNextCell = nextCell;
  pair<int, int> ans = {0, 0};
  vis.resize(n, vector<bool>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (a[i][j] == -1) continue;
      vis.assign(n, vector<bool>(m, false));
      nextCell = fNextCell;
      pair<int, int> cur = {i, j};
      int tAns = 0;
      while (cur != make_pair(-1, -1)) {
        vis[cur.first][cur.second] = true;
        tAns++;
        cur = findnextCell(cur.first, cur.second, a[cur.first][cur.second]);
      }
      if (tAns > ans.first) {
        ans.first = tAns;
        ans.second = 1;
      } else if (tAns == ans.first)
        ans.second++;
    }
  }
  cout << ans.first << " " << ans.second;
  return 0;
}
