#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;
}
