10 10
.L.....R..
.........U
..D....D..
.R......L.
....L.....
.........D
......U...
D....R....
...U......
........L.
 5 5
DD..D
.....
LU...
U...U
.UL.U
 1 1
U
 5 5
UD..L
RRD..
..RDD
UUL..
DDLRR
 19 23
U..U..R........L...D...
.D.....UL.U.U........DR
..D.U..D....L......R...
D.......RL.L....D.....R
U..D.....U...U.L..D...U
...........L...........
U....U....D.U......LRR.
......RL...U...L.......
DLU..U......UU.U.U.D...
...........D....U......
U...DL......LL.....R...
...U..DD..........LD...
.R.........D.....UU...U
....D......R..........D
.L..........R.....L....
.R........L.LL....R....
..R...D........R....D..
.LR.R..LDU.DDRL......U.
...LL.....D.....DD.....
 11 29
URRUUDDLURLRDDLLRLDUDR.UDLLD.
LRRUDLUDLDULUDL.DURDRR.RRLLRR
D.DUDDURLRDDULDUDDUDDURRDLD.L
.RULURURRDLRRRLUUUU.RDLDLRRRL
.RLDDU.UUULUURURRLLUU.RLDRDUD
LRL.URRRDDURUURUDRRDLDDULRDRL
RLULDU.LRDUDRLDLRDDDDRUUDRDLL
DLUDURRDDUDLLDLLUURLDRUURRLUL
L.RRURRDDRRURRRDDUDRRDULR.LUR
LDLRULURRUULRDUUULLU.LLU.LLLL
DUURDULDDUDLRUUDRUULURLD.RL.U
 2 2
RD
UL
 1 10
LLLLLRRRRR
 3 3
...
...
..R
 17 13
...LD.UR.RUU.
LDLULDUDRRDRL
DD.RRLRUR.UD.
RU...D...LD..
.UR.R...URUUD
.RURD.RLR.D.R
.UUU.RU...UR.
UUUU.R.......
RL.LRU.UD.DUD
LD.DRURRLRDRL
.DR..UULUDDR.
LRLURRUUDDLUR
.LRDDLLR.L.DU
DRUDLLD.LRRU.
..DL.UDL.DUL.
U.DL..D..U.RD
RR.R...RL.L..

2 2
 4 1
 1 1
 8 3
 9 1
 94 1
 4 4
 5 2
 1 1
 24 2

#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;
}
