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;
struct node {
  int U, D, L, R;
} a[5010];
char s[5010];
int n, m;
int ans, ansp;
void cover(int p) {
  if (a[p].L > -1) {
    int k = a[p].L;
    a[k].R = a[p].R;
  }
  if (a[p].R > -1) {
    int k = a[p].R;
    a[k].L = a[p].L;
  }
  if (a[p].U > -1) {
    int k = a[p].U;
    a[k].D = a[p].D;
  }
  if (a[p].D > -1) {
    int k = a[p].D;
    a[k].U = a[p].U;
  }
}
void recover(int p) {
  if (a[p].D > -1) a[a[p].D].U = p;
  if (a[p].U > -1) a[a[p].U].D = p;
  if (a[p].R > -1) a[a[p].R].L = p;
  if (a[p].L > -1) a[a[p].L].R = p;
}
int go(int p) {
  int ret = 1;
  if (s[p] == 'L') {
    cover(p);
    if (a[p].L > -1) ret += go(a[p].L);
    recover(p);
  } else if (s[p] == 'U') {
    cover(p);
    if (a[p].U > -1) ret += go(a[p].U);
    recover(p);
  } else if (s[p] == 'R') {
    cover(p);
    if (a[p].R > -1) ret += go(a[p].R);
    recover(p);
  } else {
    cover(p);
    if (a[p].D > -1) ret += go(a[p].D);
    recover(p);
  }
  return ret;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", s + m * i);
  int last[5010];
  memset(last, -1, sizeof(last));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      int p = i * m + j;
      if (s[p] != '.') {
        a[p].U = last[j];
        last[j] = p;
      }
    }
  memset(last, -1, sizeof(last));
  for (int i = n - 1; i >= 0; i--)
    for (int j = 0; j < m; j++) {
      int p = i * m + j;
      if (s[p] != '.') {
        a[p].D = last[j];
        last[j] = p;
      }
    }
  memset(last, -1, sizeof(last));
  for (int j = 0; j < m; j++)
    for (int i = 0; i < n; i++) {
      int p = i * m + j;
      if (s[p] != '.') {
        a[p].L = last[i];
        last[i] = p;
      }
    }
  memset(last, -1, sizeof(last));
  for (int j = m - 1; j >= 0; j--)
    for (int i = 0; i < n; i++) {
      int p = i * m + j;
      if (s[p] != '.') {
        a[p].R = last[i];
        last[i] = p;
      }
    }
  ans = 0;
  for (int i = 0; i < n * m; i++) {
    if (s[i] == '.') continue;
    int k = go(i);
    if (k > ans) {
      ans = k;
      ansp = 1;
    } else if (k == ans)
      ansp++;
  }
  printf("%d %d\n", ans, ansp);
  return 0;
}
