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;
static char c[5001][5001];
static char dup[5001][5001];
static int dp[5001][5001];
int n, m;
int dfs(int a, int b) {
  if (dup[a][b] == 'L' && b - 1 < 0) return 1;
  if (dup[a][b] == 'R' && b + 1 >= m) return 1;
  if (dup[a][b] == 'U' && a - 1 < 0) return 1;
  if (dup[a][b] == 'D' && a + 1 >= n) return 1;
  if (dp[a][b] != -1) return dp[a][b];
  if (dup[a][b] == 'L') {
    for (int i = b - 1; i >= 0; i--)
      if (dup[a][i] != '.') {
        dup[a][b] = '.';
        int k = 1 + dfs(a, i);
        dp[a][b] = k;
        return k;
      }
  }
  if (dup[a][b] == 'R') {
    for (int i = b + 1; i < m; i++)
      if (dup[a][i] != '.') {
        dup[a][b] = '.';
        int k = 1 + dfs(a, i);
        dp[a][b] = k;
        return k;
      }
  }
  if (dup[a][b] == 'U') {
    for (int i = a - 1; i >= 0; i--)
      if (dup[i][b] != '.') {
        dup[a][b] = '.';
        int k = 1 + dfs(i, b);
        dp[a][b] = k;
        return k;
      }
  }
  if (dup[a][b] == 'D') {
    for (int i = a + 1; i < n; i++)
      if (dup[i][b] != '.') {
        dup[a][b] = '.';
        int k = 1 + dfs(i, b);
        dp[a][b] = k;
        return k;
      }
  }
  return 1;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) dp[i][j] = -1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      cin >> c[i][j];
    }
  int ans = -1;
  int ans2 = 1;
  map<int, int> nm;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (c[i][j] != '.') {
        for (int l = 0; l < n; l++)
          for (int s = 0; s < m; s++) dup[l][s] = c[l][s];
        int k = dfs(i, j);
        nm[k]++;
        if (k > ans) ans = k;
      }
    }
  cout << ans << " " << nm[ans] << "\n";
  return 0;
}
