#include <bits/stdc++.h>
using namespace std;
const int MAX = 20010;
int n, m;
vector<char> grid(MAX, '.');
vector<int> U(MAX), D(MAX), R(MAX), L(MAX), tU(MAX), tD(MAX), tR(MAX), tL(MAX);
int erase(int x) {
  tD[tU[x]] = tD[x];
  tU[tD[x]] = tU[x];
  tR[tL[x]] = tR[x];
  tL[tR[x]] = tL[x];
  return grid[x] == 'U'   ? tU[x]
         : grid[x] == 'D' ? tD[x]
         : grid[x] == 'L' ? tL[x]
                          : tR[x];
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) cin >> grid[i * (m + 2) + j];
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      int x = i * (m + 2) + j - 1;
      L[x + 1] = (grid[x] != '.') ? x : L[x];
    }
    for (int j = m; j; --j) {
      int x = i * (m + 2) + j + 1;
      R[x - 1] = (grid[x] != '.') ? x : R[x];
    }
  }
  for (int j = 1; j <= m; ++j) {
    for (int i = 1; i <= n; ++i) {
      int x = (i - 1) * (m + 2) + j;
      U[x + m + 2] = (grid[x] != '.') ? x : U[x];
    }
    for (int i = n; i; --i) {
      int x = (i + 1) * (m + 2) + j;
      D[x - m - 2] = (grid[x] != '.') ? x : D[x];
    }
  }
  int ans = 0, cnt = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      int x = i * (m + 2) + j, tans = 0;
      if (grid[x] == '.') continue;
      tU = U, tD = D, tR = R, tL = L;
      while (x) ++tans, x = erase(x);
      if (tans == ans)
        ++cnt;
      else if (tans > ans)
        ans = tans, cnt = 1;
    }
  }
  cout << ans << ' ' << cnt << endl;
  return 0;
}
