#include <bits/stdc++.h>
using namespace std;
int n, m;
char s[5001][5001];
int p[5001][5001];
int a[5001][4], A[5001][4];
int d[5001];
int dis, num;
int main() {
  int nn = 0;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", s[i]);
  memset(a, 0, sizeof(a));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] != '.') {
        p[i][j] = ++nn;
        if (s[i][j] == 'U') d[nn] = 0;
        if (s[i][j] == 'D') d[nn] = 1;
        if (s[i][j] == 'L') d[nn] = 2;
        if (s[i][j] == 'R') d[nn] = 3;
      } else
        p[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (p[i][j]) {
        for (int k = i - 1; k >= 0; k--) {
          if (p[k][j]) {
            a[p[i][j]][0] = p[k][j];
            break;
          }
        }
        for (int k = i + 1; k < n; k++) {
          if (p[k][j]) {
            a[p[i][j]][1] = p[k][j];
            break;
          }
        }
        for (int k = j - 1; k >= 0; k--) {
          if (p[i][k]) {
            a[p[i][j]][2] = p[i][k];
            break;
          }
        }
        for (int k = j + 1; k < m; k++) {
          if (p[i][k]) {
            a[p[i][j]][3] = p[i][k];
            break;
          }
        }
      }
    }
  }
  dis = 0;
  num = 0;
  for (int i = 1; i <= nn; i++) {
    memcpy(A, a, sizeof(a));
    int j = i;
    int length = 0;
    while (j) {
      length++;
      A[A[j][0]][1] = A[j][1];
      A[A[j][1]][0] = A[j][0];
      A[A[j][2]][3] = A[j][3];
      A[A[j][3]][2] = A[j][2];
      j = A[j][d[j]];
    }
    if (dis < length) {
      dis = length;
      num = 1;
    } else if (dis == length)
      num++;
  }
  printf("%d %d\n", dis, num);
  return 0;
}
