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;
char aa[5001];
int n, m;
bool avail[5001];
int L[5001], R[5001], U[5001], D[5001];
int cnt[5001];
int encode(int i, int j) {
  if (i < 0 || i >= n || j < 0 || j >= m) return -1;
  return i * m + j;
}
void del(int cur) {
  int ll = L[cur], rr = R[cur], uu = U[cur], dd = D[cur];
  if (ll != -1) R[ll] = rr;
  if (rr != -1) L[rr] = ll;
  if (uu != -1) D[uu] = dd;
  if (dd != -1) U[dd] = uu;
  avail[cur] = 0;
}
int main() {
  int i, j, ii, jj;
  while (scanf("%d%d", &n, &m) == 2) {
    for (i = 0; i < n; i++) {
      for (j = 0; j < m; j++) {
        char c;
        scanf(" %c", &c);
        aa[i * m + j] = c;
        L[i * m + j] = encode(i, j - 1);
        R[i * m + j] = encode(i, j + 1);
        U[i * m + j] = encode(i - 1, j);
        D[i * m + j] = encode(i + 1, j);
      }
    }
    memset(cnt, 0, sizeof(cnt));
    for (ii = 0; ii < n; ii++) {
      for (jj = 0; jj < m; jj++) {
        int now = encode(ii, jj);
        if (aa[now] == '.') continue;
        for (i = 0; i < n; i++) {
          for (j = 0; j < m; j++) {
            L[i * m + j] = encode(i, j - 1);
            R[i * m + j] = encode(i, j + 1);
            U[i * m + j] = encode(i - 1, j);
            D[i * m + j] = encode(i + 1, j);
            avail[i * m + j] = 1;
          }
        }
        for (i = 0; i < n; i++) {
          for (j = 0; j < m; j++) {
            int cur = encode(i, j);
            if (aa[cur] == '.') del(cur);
          }
        }
        int xx = 0;
        while (now != -1) {
          int temp = now;
          if (aa[now] == 'L') {
            now = L[now];
          } else if (aa[now] == 'R') {
            now = R[now];
          } else if (aa[now] == 'U') {
            now = U[now];
          } else if (aa[now] == 'D') {
            now = D[now];
          }
          del(temp);
          xx++;
        }
        cnt[xx]++;
      }
    }
    for (i = 5000; i >= 0; i--) {
      if (cnt[i]) {
        printf("%d %d\n", i, cnt[i]);
        break;
      }
    }
  }
}
