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<int> > p, pr;
int n, m;
int solve(int x, int y) {
  p = pr;
  int ans = 0, nx, ny, v;
  while (true) {
    v = p[x][y];
    p[x][y] = -1;
    ans++;
    nx = -1;
    ny = -1;
    if (v == 0) {
      for (int i = y - 1; i >= 0 && ny == -1; --i)
        if (p[x][i] >= 0) ny = i;
      if (ny == -1) break;
      y = ny;
    } else if (v == 1) {
      for (int i = y + 1; i < m && ny == -1; ++i)
        if (p[x][i] >= 0) ny = i;
      if (ny == -1) break;
      y = ny;
    } else if (v == 2) {
      for (int i = x - 1; i >= 0 && nx == -1; --i)
        if (p[i][y] >= 0) nx = i;
      if (nx == -1) break;
      x = nx;
    } else if (v == 3) {
      for (int i = x + 1; i < n && nx == -1; ++i)
        if (p[i][y] >= 0) nx = i;
      if (nx == -1) break;
      x = nx;
    } else
      break;
  }
  return ans;
}
int main() {
  cin >> n >> m;
  p.resize(n, vector<int>(m, -1));
  char ch;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> ch;
      if (ch == 'L')
        p[i][j] = 0;
      else if (ch == 'R')
        p[i][j] = 1;
      else if (ch == 'U')
        p[i][j] = 2;
      else if (ch == 'D')
        p[i][j] = 3;
    }
  }
  pr = p;
  int mans = 0, cans = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) {
      if (pr[i][j] == -1) continue;
      int sol = solve(i, j);
      if (sol == mans)
        cans++;
      else if (sol > mans) {
        mans = sol;
        cans = 1;
      }
    }
  cout << mans << ' ' << cans;
  return 0;
}
