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 n, m;
string str[5005];
short s[4][5005][5005];
int sum(int a, int b, int c) {
  int ret = 0;
  for (int i = c; i > 0; i -= i & -i) ret += s[a][b][i];
  return ret;
}
int get(int a, int b, int c) {
  ++c;
  int r = sum(a, b, c);
  if (r == 0) return -1;
  int low = 0;
  int high = c;
  while (low < high) {
    int mid = (low + high) / 2;
    if (sum(a, b, mid) < r)
      low = mid + 1;
    else
      high = mid;
  }
  return low - 1;
}
void update(int a, int b, int c, int by) {
  ++c;
  for (int i = c; i < 5005; i += i & -i) s[a][b][i] += by;
}
int get(char ch) {
  if (ch == 'U') return 0;
  if (ch == 'D') return 1;
  if (ch == 'L') return 2;
  return 3;
}
int go(int ii, int jj) {
  if (ii == -1 || jj == -1 || ii == n || jj == m) return 0;
  int g = get(str[ii][jj]);
  int ret = 1;
  update(0, jj, ii, -1);
  update(1, jj, n - 1 - ii, -1);
  update(2, ii, jj, -1);
  update(3, ii, m - 1 - jj, -1);
  if (g == 0) ret += go(get(0, jj, ii), jj);
  if (g == 1) ret += go(n - 1 - get(1, jj, n - 1 - ii), jj);
  if (g == 2) ret += go(ii, get(2, ii, jj));
  if (g == 3) ret += go(ii, m - 1 - get(3, ii, m - 1 - jj));
  return ret;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; ++i) cin >> str[i];
  int best = 0;
  int cnt = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 1; j < m; ++j) {
      if (str[i][j] == '.') continue;
      memset(s, 0, sizeof(s));
      for (int ii = 0; ii < n; ++ii)
        for (int jj = 0; jj < m; ++jj) {
          if (str[ii][jj] == '.') continue;
          update(0, jj, ii, 1);
          update(1, jj, n - 1 - ii, 1);
          update(2, ii, jj, 1);
          update(3, ii, m - 1 - jj, 1);
        }
      int nbest = go(i, j);
      if (nbest > best) {
        best = nbest;
        cnt = 1;
      } else if (nbest == best)
        ++cnt;
    }
  cout << best << " " << cnt << endl;
  return 0;
}
