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>
char a[1005][1005], b[1005][1005];
int n, m;
int move(int i, int j) {
  int ans = 1, k, t = 0;
  while (1) {
    int flag = 0;
    switch (a[i][j]) {
      case 'D':
        a[i][j] = '.';
        for (k = i + 1; k < n; k++) {
          if (a[k][j] != '.') {
            i = k;
            flag = 1;
            ans++;
            break;
          }
        }
        if (!flag) return ans;
        break;
      case 'U':
        a[i][j] = '.';
        for (k = i - 1; k >= 0; k--) {
          if (a[k][j] != '.') {
            i = k;
            flag = 1;
            ans++;
            break;
          }
        }
        if (!flag) return ans;
        break;
      case 'R':
        a[i][j] = '.';
        for (k = j + 1; k < m; k++) {
          if (a[i][k] != '.') {
            j = k;
            flag = 1;
            ans++;
            break;
          }
        }
        if (!flag) return ans;
        break;
      case 'L':
        a[i][j] = '.';
        for (k = j - 1; k >= 0; k--) {
          if (a[i][k] != '.') {
            j = k;
            flag = 1;
            ans++;
            break;
          }
        }
        if (!flag) return ans;
        break;
    }
    t++;
  }
}
int main() {
  int max = 0, i, j, p, k, l;
  scanf("%d%d", &n, &m);
  int ans[1000009][2];
  for (i = 0; i < n; i++) scanf("%s", a[i]);
  for (k = 0; k < n; k++)
    for (l = 0; l < m; l++) b[k][l] = a[k][l];
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) {
      if (a[i][j] == '.') continue;
      p = move(i, j);
      for (k = 0; k < n; k++)
        for (l = 0; l < m; l++) a[k][l] = b[k][l];
      if (p > max) max = p;
      ans[p][0] = 1;
      ans[p][1]++;
    }
  printf("%d %d\n", max, ans[max][1]);
  return 0;
}
