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;
const int dx[4] = {0, 1, -1, 0}, dy[4] = {-1, 0, 0, 1};
const char D[4] = {'L', 'D', 'U', 'R'};
char p[5010][5010];
int x[5010], y[5010], mk[5010][5010], d[5010], w[5010][4], u[5010][4], a, b, i,
    j, k, t, s, tx, ty, n, m, cnt;
int main() {
  scanf("%d%d", &n, &m);
  getchar();
  cnt = 0;
  for (i = 0; i < (n); ++i) {
    gets(p[i]);
    for (j = 0; j < (m); ++j)
      if (p[i][j] != '.') {
        x[cnt] = i;
        y[cnt] = j;
        for (k = 0; k < (4); ++k)
          if (p[i][j] == D[k]) d[cnt] = k;
        mk[i][j] = cnt++;
      }
  }
  for (i = 0; i < (cnt); ++i)
    for (k = 0; k < (4); ++k) {
      tx = x[i] + dx[k];
      ty = y[i] + dy[k];
      w[i][k] = -1;
      while (tx >= 0 && tx < n && ty >= 0 && ty < m) {
        if (p[tx][ty] != '.') {
          w[i][k] = mk[tx][ty];
          break;
        }
        tx += dx[k];
        ty += dy[k];
      }
    }
  a = -1;
  for (i = 0; i < (cnt); ++i) {
    t = i;
    s = 0;
    for (j = 0; j < (cnt); ++j)
      for (k = 0; k < (4); ++k) u[j][k] = w[j][k];
    do {
      ++s;
      for (k = 0; k < (4); ++k)
        if (u[t][k] >= 0) u[u[t][k]][3 - k] = u[t][3 - k];
      t = u[t][d[t]];
    } while (t != -1);
    if (s > a) {
      a = s;
      b = 1;
    } else
      b += a == s ? 1 : 0;
  }
  printf("%d %d\n", a, b);
  return 0;
}
