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 b[5005];
int n, m;
int l[5005], r[5005], u[5005], d[5005];
void init() {
  fill(l, l + n * m, n * m);
  fill(r, r + n * m, n * m);
  fill(u, u + n * m, n * m);
  fill(d, d + n * m, n * m);
  for (int i = 0, ThxDem = n; i < ThxDem; ++i) {
    int z = n * m;
    for (int j = 0, ThxDem = m; j < ThxDem; ++j)
      if (b[i * m + j] != '.') {
        l[i * m + j] = z;
        r[z] = i * m + j;
        z = i * m + j;
      }
  }
  for (int j = 0, ThxDem = m; j < ThxDem; ++j) {
    int z = n * m;
    for (int i = 0, ThxDem = n; i < ThxDem; ++i)
      if (b[i * m + j] != '.') {
        u[i * m + j] = z;
        d[z] = i * m + j;
        z = i * m + j;
      }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0, ThxDem = n; i < ThxDem; ++i) scanf("%s", b + i * m);
  int r0 = 0, r1 = 0;
  for (int i = 0, ThxDem = n; i < ThxDem; ++i)
    for (int j = 0, ThxDem = m; j < ThxDem; ++j)
      if (b[i * m + j] != '.') {
        init();
        int x = i * m + j, c = 0;
        while (x < n * m) {
          c++;
          l[r[x]] = l[x];
          r[l[x]] = r[x];
          u[d[x]] = u[x];
          d[u[x]] = d[x];
          if (b[x] == 'L')
            x = l[x];
          else if (b[x] == 'R')
            x = r[x];
          else if (b[x] == 'U')
            x = u[x];
          else
            x = d[x];
        }
        if (c > r0)
          r0 = c, r1 = 1;
        else if (c == r0)
          r1++;
      }
  printf("%d %d\n", r0, r1);
  return 0;
}
