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 point {
  point *l, *r, *u, *d;
  int id;
} p[5010], q[5010], *ii, *jj;
int i, j, n, m;
int num = 0;
char s[5010];
inline void rm(point* pp) {
  if (pp->l) {
    pp->l->r = pp->r;
  }
  if (pp->r) {
    pp->r->l = pp->l;
  }
  if (pp->d) {
    pp->d->u = pp->u;
  }
  if (pp->u) {
    pp->u->d = pp->d;
  }
}
int main() {
  scanf("%d %d", &n, &m);
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      scanf(" %c", &s[num]);
      p[num].id = num;
      if (i) {
        assert(num >= m);
        p[num].u = &p[num - m];
        p[num - m].d = &p[num];
      }
      if (j) {
        p[num].l = &p[num - 1];
        p[num - 1].r = &p[num];
      }
      num++;
    }
  }
  for (i = 0; i < num; i++) {
    if (s[i] == '.') {
      rm(&p[i]);
    }
  }
  int ans = 0, ansnum = 0, now;
  memcpy(q, p, sizeof(p));
  for (i = 0; i < num; i++) {
    if (s[i] == '.') {
      continue;
    }
    if (i) memcpy(p, q, sizeof(q));
    ii = &p[i];
    now = 0;
    while (ii) {
      now++;
      rm(ii);
      switch (s[ii->id]) {
        case 'D':
          ii = ii->d;
          break;
        case 'U':
          ii = ii->u;
          break;
        case 'L':
          ii = ii->l;
          break;
        case 'R':
          ii = ii->r;
          break;
        default:
          assert(0);
      }
    }
    if (now > ans) {
      ans = now;
      ansnum = 1;
    } else if (now == ans) {
      ansnum++;
    }
  }
  printf("%d %d\n", ans, ansnum);
  return 0;
}
