#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5 * (int)1e3 + 10;
int l[MAXN], r[MAXN], u[MAXN], d[MAXN];
int tl[MAXN], tr[MAXN], tu[MAXN], td[MAXN];
int n, m;
vector<char> s[MAXN];
int node(int x, int y) { return x * m + y + 1; }
int getfa(int x, int *fa) {
  if (fa[x] == x) return fa[x];
  return fa[x] = getfa(fa[x], fa);
}
char st[MAXN];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%s", st);
    for (int j = 0; j < m; j++) s[i].push_back(st[j]);
  }
  for (int i = 0; i < n; i++) {
    int las = 0;
    for (int j = 0; j < m; j++) {
      int x = node(i, j);
      l[x] = las;
      if (s[i][j] != '.') las = x;
    }
    las = 0;
    for (int j = m - 1; j >= 0; j--) {
      int x = node(i, j);
      r[x] = las;
      if (s[i][j] != '.') las = x;
    }
  }
  for (int i = 0; i < m; i++) {
    int las = 0;
    for (int j = 0; j < n; j++) {
      int x = node(j, i);
      u[x] = las;
      if (s[j][i] != '.') las = x;
    }
    las = 0;
    for (int j = n - 1; j >= 0; j--) {
      int x = node(j, i);
      d[x] = las;
      if (s[j][i] != '.') las = x;
    }
  }
  int total = n * m;
  int mx = 0, sum = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '.') continue;
      int step = 0;
      int now = node(i, j);
      for (int k = 0; k <= total; k++)
        tl[k] = l[k], tr[k] = r[k], tu[k] = u[k], td[k] = d[k];
      int ss = 0;
      while (now != 0) {
        int x = (now - 1) / m, y = (now - 1) % m;
        step++;
        tr[tl[now]] = tr[now];
        tl[tr[now]] = tl[now];
        td[tu[now]] = td[now];
        tu[td[now]] = tu[now];
        if (s[x][y] == 'R')
          now = tr[now];
        else if (s[x][y] == 'L')
          now = tl[now];
        else if (s[x][y] == 'D')
          now = td[now];
        else if (s[x][y] == 'U')
          now = tu[now];
      }
      if (step > mx) {
        mx = step;
        sum = 1;
      } else if (step == mx)
        sum++;
    }
  cout << mx << " " << sum << endl;
  return 0;
}
