#include <bits/stdc++.h>
using namespace std;
struct node {
  node *u, *d, *l, *r;
  int x, y;
  node() {
    u = NULL;
    d = NULL;
    l = NULL;
    r = NULL;
  }
};
vector<vector<node> > arr;
vector<string> in;
int n, m;
void calcr(int x) {
  node *curr = NULL;
  for (int i = 0; i < m; ++i) {
    if (in[x][i] == '.') continue;
    arr[x][i].l = curr;
    if (curr != NULL) curr->r = &arr[x][i];
    curr = &arr[x][i];
  }
}
void calcc(int x) {
  node *curr = NULL;
  for (int i = 0; i < n; ++i) {
    if (in[i][x] == '.') continue;
    arr[i][x].u = curr;
    if (curr != NULL) curr->d = &arr[i][x];
    curr = &arr[i][x];
  }
}
int dfs(node *curr) {
  int cx = curr->x, cy = curr->y, ret = 1;
  node *nex;
  if (in[cx][cy] == 'U') {
    if (curr->u == NULL) return 1;
    nex = curr->u;
  } else if (in[cx][cy] == 'D') {
    if (curr->d == NULL) return 1;
    nex = curr->d;
  } else if (in[cx][cy] == 'L') {
    if (curr->l == NULL) return 1;
    nex = curr->l;
  } else if (in[cx][cy] == 'R') {
    if (curr->r == NULL) return 1;
    nex = curr->r;
  }
  node *u = curr->u, *d = curr->d, *l = curr->l, *r = curr->r;
  if (l != NULL) l->r = r;
  if (r != NULL) r->l = l;
  if (u != NULL) u->d = d;
  if (d != NULL) d->u = u;
  ret += dfs(nex);
  if (l != NULL) l->r = curr;
  if (r != NULL) r->l = curr;
  if (u != NULL) u->d = curr;
  if (d != NULL) d->u = curr;
  return ret;
}
int main() {
  cin >> n >> m;
  in.resize(n);
  arr.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> in[i];
    arr[i].resize(m);
    for (int j = 0; j < m; ++j) arr[i][j].x = i, arr[i][j].y = j;
  }
  for (int i = 0; i < n; ++i) calcr(i);
  for (int i = 0; i < m; ++i) calcc(i);
  int ans = 0, c = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (in[i][j] == '.') continue;
      int ret = dfs(&arr[i][j]);
      if (ret == ans) c++;
      if (ret > ans) {
        ans = ret;
        c = 1;
      }
    }
  }
  cout << ans << " " << c;
}
