#include <bits/stdc++.h>
using namespace std;
struct node {
  int d, dir[4];
} e[5050];
int dx[5] = {0, 0, -1, 1};
int dy[5] = {-1, 1, 0, 0};
int n, m, ans = -1, sum = 0;
int dir(int s, int i) {
  int x = s / m, y = s % m;
  while (x + dx[i] >= 0 && x + dx[i] < n && y + dy[i] >= 0 && y + dy[i] < m) {
    x += dx[i];
    y += dy[i];
    if (e[x * m + y].d == -1)
      continue;
    else
      return x * m + y;
  }
  return -1;
}
void init() {
  scanf("%d%d", &n, &m);
  getchar();
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int s = i * m + j;
      char c;
      scanf("%c", &c);
      if (c == 'L') e[s].d = 0;
      if (c == 'R') e[s].d = 1;
      if (c == 'U') e[s].d = 2;
      if (c == 'D') e[s].d = 3;
      if (c == '.') e[s].d = -1;
    }
    getchar();
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      int s = i * m + j;
      e[s].dir[0] = dir(s, 0);
      e[s].dir[1] = dir(s, 1);
      e[s].dir[2] = dir(s, 2);
      e[s].dir[3] = dir(s, 3);
    }
}
void dfs(int s, int t) {
  int i = e[s].d, o = 0;
  if (e[s].dir[i] != -1) {
    o = 1;
    e[e[s].dir[0]].dir[1] = e[s].dir[1];
    e[e[s].dir[1]].dir[0] = e[s].dir[0];
    e[e[s].dir[2]].dir[3] = e[s].dir[3];
    e[e[s].dir[3]].dir[2] = e[s].dir[2];
    dfs(e[s].dir[i], t + 1);
    e[e[s].dir[0]].dir[1] = s;
    e[e[s].dir[1]].dir[0] = s;
    e[e[s].dir[2]].dir[3] = s;
    e[e[s].dir[3]].dir[2] = s;
  }
  if (!o) {
    if (t > ans) {
      ans = t;
      sum = 1;
    } else if (t == ans)
      sum++;
  }
}
int main() {
  init();
  for (int i = 0; i < m * n; i++)
    if (e[i].d != -1) dfs(i, 1);
  printf("%d %d\n", ans, sum);
  return 0;
}
