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;
const int maxN = 5000;
string s[5001];
int n, m, ans, t;
int **l, **r, **u, **d;
void build() {
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (!i)
        u[i][j] = -1;
      else {
        u[i][j] = u[i - 1][j];
        if (s[i - 1][j] != '.') u[i][j] = i - 1;
      }
      if (!j)
        l[i][j] = -1;
      else {
        l[i][j] = l[i][j - 1];
        if (s[i][j - 1] != '.') l[i][j] = j - 1;
      }
    }
  for (int i = n - 1; i + 1; i--)
    for (int j = m - 1; j + 1; j--) {
      if (!(n - i - 1))
        d[i][j] = -1;
      else {
        d[i][j] = d[i + 1][j];
        if (s[i + 1][j] != '.') d[i][j] = i + 1;
      }
      if (!(m - j - 1))
        r[i][j] = -1;
      else {
        r[i][j] = r[i][j + 1];
        if (s[i][j + 1] != '.') r[i][j] = j + 1;
      }
    }
}
void upd(int y, int x) {
  if (r[y][x] >= 0) l[y][r[y][x]] = l[y][x];
  if (l[y][x] >= 0) r[y][l[y][x]] = r[y][x];
  if (d[y][x] >= 0) u[d[y][x]][x] = u[y][x];
  if (u[y][x] >= 0) d[u[y][x]][x] = d[y][x];
}
int go(int y, int x) {
  if (min(x, y) < 0) return 0;
  char c = s[y][x];
  upd(y, x);
  if (c == 'L') return go(y, l[y][x]) + 1;
  if (c == 'R') return go(y, r[y][x]) + 1;
  if (c == 'U') return go(u[y][x], x) + 1;
  return go(d[y][x], x) + 1;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> s[i];
  l = new int *[n + 10];
  r = new int *[n + 10];
  u = new int *[n + 10];
  d = new int *[n + 10];
  for (int i = 0; i < n + 10; i++) {
    l[i] = new int[m + 10];
    r[i] = new int[m + 10];
    d[i] = new int[m + 10];
    u[i] = new int[m + 10];
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (s[i][j] != '.') {
        build();
        int kk = go(i, j);
        if (kk > ans) {
          t = 0;
          ans = kk;
        }
        if (kk == ans) t++;
      }
  cout << ans << " " << t << endl;
  cin >> n;
}
