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;
template <typename T, typename TT>
ostream &operator<<(ostream &s, pair<T, TT> t) {
  return s << "(" << t.first << "," << t.second << ")";
}
template <typename T>
ostream &operator<<(ostream &s, vector<T> t) {
  for (int i = 0; i < t.size(); i++) s << t[i] << " ";
  return s;
}
char s[5010][5010];
int v[5010][5010], tot, n, m;
void dfs(int first, int second, int &k) {
  v[first][second] = tot;
  if (s[first][second] == 'L') {
    for (int i = second - 1; i >= 0; i--)
      if (v[first][i] != tot && s[first][i] != '.') {
        dfs(first, i, ++k);
        return;
      }
  }
  if (s[first][second] == 'R') {
    for (int i = second + 1; i < m; i++)
      if (v[first][i] != tot && s[first][i] != '.') {
        dfs(first, i, ++k);
        return;
      }
  }
  if (s[first][second] == 'U') {
    for (int i = first - 1; i >= 0; i--)
      if (v[i][second] != tot && s[i][second] != '.') {
        dfs(i, second, ++k);
        return;
      }
  }
  if (s[first][second] == 'D') {
    for (int i = first + 1; i < n; i++)
      if (v[i][second] != tot && s[i][second] != '.') {
        dfs(i, second, ++k);
        return;
      }
  }
}
bool check(int first, int second) {
  int i;
  for (i = 0; i < second; i++)
    if (s[first][i] == 'R') return 0;
  for (i = second + 1; i < m; i++)
    if (s[first][i] == 'L') return 0;
  for (i = 0; i < first; i++)
    if (s[i][second] == 'D') return 0;
  for (i = first + 1; i < n; i++)
    if (s[i][second] == 'U') return 0;
  return 1;
}
int main() {
  int i, j, T, k;
  while (~scanf("%d%d", &n, &m)) {
    for (i = 0; i < n; i++) scanf("%s", s[i]);
    memset(v, 0, sizeof(v));
    int ans = 0, num = 0;
    tot = 0;
    for (i = 0; i < n; i++)
      for (j = 0; j < m; j++)
        if (check(i, j)) {
          tot++;
          k = 1;
          dfs(i, j, k);
          if (ans < k)
            ans = k, num = 1;
          else if (ans == k)
            num++;
        }
    for (i = 0; i < n; i++)
      for (j = 0; j < m; j++)
        if (v[i][j] == 0) {
          tot++;
          k = 1;
          dfs(i, j, k);
          if (ans < k)
            ans = k, num = 1;
          else if (ans == k)
            num++;
        }
    printf("%d %d\n", ans, num);
  }
  return 0;
}
