#include <bits/stdc++.h>
using namespace std;
int n, m;
int k;
bool debug = false;
int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1}, ss;
map<char, int> cd;
struct uz {
  int direct, u = 0, d = 0, l = 0, r = 0;
};
vector<char> mp[5005];
vector<uz> b[5005];
void init() {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (mp[i][j] == '.')
        b[i][j].direct = -1;
      else
        b[i][j].direct = cd[mp[i][j]];
      b[i][j].u = i - 1;
      b[i][j].d = i + 1;
      b[i][j].l = j - 1;
      b[i][j].r = j + 1;
    }
  }
}
void move(int i, int j, int direct) {
  if (mp[i][j] != '.') {
    ss++;
    direct = b[i][j].direct;
  }
  b[b[i][j].u][j].d = b[i][j].d;
  b[b[i][j].d][j].u = b[i][j].u;
  b[i][b[i][j].l].r = b[i][j].r;
  b[i][b[i][j].r].l = b[i][j].l;
  if (direct == 0)
    i = b[i][j].u;
  else if (direct == 1)
    i = b[i][j].d;
  else if (direct == 2)
    j = b[i][j].l;
  else if (direct == 3)
    j = b[i][j].r;
  if (i > 0 && j > 0 && i <= n && j <= m) move(i, j, direct);
}
int main() {
  scanf("%d%d", &n, &m);
  char cc[m + 5];
  cd['U'] = 0;
  cd['D'] = 1;
  cd['L'] = 2;
  cd['R'] = 3;
  for (int i = 1; i <= n; i++) {
    scanf("%s", cc);
    mp[i].push_back('.');
    for (int j = 0; j < m; j++) mp[i].push_back(cc[j]);
  }
  for (int i = 0; i < n + 3; i++) b[i].resize(m + 2);
  int ans = 0, ansc = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (mp[i][j] != '.') {
        init();
        ss = 0;
        move(i, j, b[i][j].direct);
        if (ss > ans) {
          ans = ss;
          ansc = 1;
        } else if (ss == ans)
          ansc++;
      }
  printf("%d %d\n", ans, ansc);
  return 0;
}
