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;
short nt[5005][4];
int n, m;
char s[5010][5010];
char g[] = "URDL";
int run(int first, int second) {
  int id = first * m + second;
  for (int d = (0); d < (int)(4); d++) {
    if (s[first][second] == g[d]) {
      if (nt[id][d] == -1) break;
      int nid = nt[id][d];
      for (int k = (0); k < (int)(2); k++) {
        int id1 = nt[id][k];
        int id2 = nt[id][k + 2];
        nt[id1][k + 2] = id2;
        nt[id2][k] = id1;
      }
      int ret = run(nid / m, nid % m) + 1;
      for (int k = (0); k < (int)(2); k++) {
        int id1 = nt[id][k];
        int id2 = nt[id][k + 2];
        nt[id1][k + 2] = id;
        nt[id2][k] = id;
      }
      return ret;
    }
  }
  return 1;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = (0); i < (int)(n); i++) scanf("%s", s[i]);
  memset(nt, -1, sizeof(nt));
  int a[5010];
  memset(a, -1, sizeof(a));
  for (int i = (0); i < (int)(n); i++) {
    for (int j = (0); j < (int)(m); j++) {
      if (s[i][j] == '.') continue;
      int id = i * m + j;
      if (a[j] != -1) {
        nt[a[j]][2] = id;
        nt[id][0] = a[j];
      }
      a[j] = id;
    }
  }
  memset(a, -1, sizeof(a));
  for (int j = (0); j < (int)(m); j++) {
    for (int i = (0); i < (int)(n); i++) {
      if (s[i][j] == '.') continue;
      int id = i * m + j;
      if (a[i] != -1) {
        nt[a[i]][1] = id;
        nt[id][3] = a[i];
      }
      a[i] = id;
    }
  }
  int ans = 0, cnt = 0;
  for (int i = (0); i < (int)(n); i++) {
    for (int j = (0); j < (int)(m); j++) {
      if (s[i][j] == '.') continue;
      int first = i, second = j;
      int cc = run(first, second);
      if (cc > ans)
        ans = cc, cnt = 1;
      else if (cc == ans)
        cnt++;
    }
  }
  printf("%d %d\n", ans, cnt);
  return 0;
}
