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;
int a[5010][4], aa[5010][4], d[5010];
int main() {
  int r, c, n = 0;
  scanf("%d%d\n", &r, &c);
  char s[r][c];
  for (int i = 0; i < r; i++) gets(s[i]);
  int b[r][c];
  memset(b, 0, sizeof(b));
  for (int i = 0; i < r; i++)
    for (int j = 0; j < c; j++)
      if (s[i][j] != '.') {
        b[i][j] = ++n;
        if (s[i][j] == 'U') d[n] = 0;
        if (s[i][j] == 'D') d[n] = 1;
        if (s[i][j] == 'L') d[n] = 2;
        if (s[i][j] == 'R') d[n] = 3;
      }
  for (int i = 0; i < r; i++)
    for (int j = 0; j < c; j++)
      if (b[i][j]) {
        for (int k = i - 1; k >= 0; k--)
          if (b[k][j]) {
            a[b[i][j]][0] = b[k][j];
            break;
          }
        for (int k = i + 1; k < r; k++)
          if (b[k][j]) {
            a[b[i][j]][1] = b[k][j];
            break;
          }
        for (int k = j - 1; k >= 0; k--)
          if (b[i][k]) {
            a[b[i][j]][2] = b[i][k];
            break;
          }
        for (int k = j + 1; k < c; k++)
          if (b[i][k]) {
            a[b[i][j]][3] = b[i][k];
            break;
          }
      }
  int ans1 = 0, ans2;
  for (int i = 1; i <= n; i++) {
    int j = i, cnt = 0;
    memcpy(aa, a, sizeof(a));
    while (j) {
      aa[aa[j][0]][1] = aa[j][1];
      aa[aa[j][1]][0] = aa[j][0];
      aa[aa[j][2]][3] = aa[j][3];
      aa[aa[j][3]][2] = aa[j][2];
      cnt++;
      j = aa[j][d[j]];
    }
    if (cnt > ans1) {
      ans1 = cnt;
      ans2 = 0;
    }
    if (cnt == ans1) ans2++;
  }
  cout << ans1 << ' ' << ans2 << endl;
}
