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 N = 5e3 + 1;
vector<char> g[N];
vector<int> l[N], r[N], u[N], d[N];
int n, m;
void read() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    r[i].resize(m), l[i].resize(m), u[i].resize(m), d[i].resize(m);
    string str;
    cin >> str;
    for (int j = 0; j < m; j++) g[i].push_back(str[j]);
  }
}
void init() {
  for (int i = 0; i < n; i++) {
    int last = -1;
    for (int j = 0; j < m; j++) {
      l[i][j] = last;
      if (g[i][j] != '.') last = j;
    }
  }
  for (int i = 0; i < n; i++) {
    int last = -1;
    for (int j = m - 1; j >= 0; j--) {
      r[i][j] = last;
      if (g[i][j] != '.') last = j;
    }
  }
  for (int j = 0; j < m; j++) {
    int last = -1;
    for (int i = 0; i < n; i++) {
      u[i][j] = last;
      if (g[i][j] != '.') last = i;
    }
  }
  for (int j = 0; j < m; j++) {
    int last = -1;
    for (int i = n - 1; i >= 0; i--) {
      d[i][j] = last;
      if (g[i][j] != '.') last = i;
    }
  }
}
void modify(int i, int j) {
  if (l[i][j] != -1) r[i][l[i][j]] = r[i][j];
  if (r[i][j] != -1) l[i][r[i][j]] = l[i][j];
  if (u[i][j] != -1) d[u[i][j]][j] = d[i][j];
  if (d[i][j] != -1) u[d[i][j]][j] = u[i][j];
}
int start(int i, int j) {
  if (g[i][j] == '.') return -1;
  if (g[i][j] == 'L') {
    if (l[i][j] == -1) return 1;
    modify(i, j);
    return start(i, l[i][j]) + 1;
  } else if (g[i][j] == 'R') {
    if (r[i][j] == -1) return 1;
    modify(i, j);
    return start(i, r[i][j]) + 1;
  } else if (g[i][j] == 'U') {
    if (u[i][j] == -1) return 1;
    modify(i, j);
    return start(u[i][j], j) + 1;
  } else if (g[i][j] == 'D') {
    if (d[i][j] == -1) return 1;
    modify(i, j);
    return start(d[i][j], j) + 1;
  }
}
void solve() {
  int ans = -1, cnt = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      init();
      int ret = start(i, j);
      if (ret > ans) cnt = 0, ans = ret;
      if (ret == ans) cnt++;
    }
  }
  cout << ans << ' ' << cnt << '\n';
}
void test() {
  init();
  cout << start(2, 2) << '\n';
}
int main() {
  read();
  solve();
  return 0;
}
