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 mape[5005][5005];
bool ma[5005][5005];
int main() {
  int n, m;
  int i, j;
  int i1, j1;
  int i2, j2;
  int bushu, tmp, shuliang;
  while (scanf("%d%d", &n, &m) != EOF) {
    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++) {
        cin >> mape[i][j];
      }
    tmp = 0;
    bushu = tmp;
    shuliang = 0;
    for (i1 = 1; i1 <= n; i1++)
      for (j1 = 1; j1 <= m; j1++) {
        i2 = i1;
        j2 = j1;
        tmp = 0;
        memset(ma, 0, sizeof(ma));
        while (!(mape[i2][j2] == '.' || ma[i2][j2])) {
          if (mape[i2][j2] == 'R') {
            ma[i2][j2] = 1;
            j2++;
            while ((mape[i2][j2] == '.' || ma[i2][j2]) && j2 <= m) {
              j2++;
            }
            tmp++;
            if (j2 > m) {
              ma[i2][j2] = 1;
            }
          } else if (mape[i2][j2] == 'L') {
            ma[i2][j2] = 1;
            j2--;
            while ((mape[i2][j2] == '.' || ma[i2][j2]) && j2 > 0) {
              j2--;
            }
            tmp++;
            if (j2 <= 0) {
              ma[i2][j2] = 1;
            }
          } else if (mape[i2][j2] == 'U') {
            ma[i2][j2] = 1;
            i2--;
            while ((mape[i2][j2] == '.' || ma[i2][j2]) && i2 > 0) {
              i2--;
            }
            tmp++;
            if (i2 <= 0) {
              ma[i2][j2] = 1;
            }
          } else if (mape[i2][j2] == 'D') {
            ma[i2][j2] = 1;
            i2++;
            while ((mape[i2][j2] == '.' || ma[i2][j2]) && j2 <= n) {
              i2++;
            }
            tmp++;
            if (i2 > n) {
              ma[i2][j2] = 1;
            }
          }
        }
        if (tmp > bushu) {
          bushu = tmp;
          shuliang = 1;
        } else if (tmp == bushu)
          shuliang++;
      }
    printf("%d %d\n", bushu, shuliang);
  }
  return 0;
}
