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 edge {
  int k, next;
} e[300000];
const int maxn = 10000;
const int st = 10000000;
int first[10000], d[10000];
bool bi[10000];
int n, m, p1, p2, p3, S, nn;
void addedge(int p, int q) {
  e[++nn].k = q;
  e[nn].next = first[p];
  first[p] = nn;
}
void dfs(int k) {
  for (int i = first[k]; i; i = e[i].next)
    if (bi[e[i].k]) {
      bi[e[i].k] = false;
      dfs(e[i].k);
      d[k] = d[e[i].k] + 1;
      break;
    }
}
string a[5006];
int main() {
  nn = 0;
  memset(first, 0, sizeof(first));
  scanf("%d%d", &n, &m);
  char s[5006];
  for (int i = 1; i <= n; ++i) {
    scanf("%s", s);
    a[i] = s;
  }
  S = (n * m + 2);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      int t = (i - 1) * m + j;
      if (a[i][j - 1] == 'U')
        for (int k = 1; k <= i - 1; ++k)
          if (a[k][j - 1] != '.') addedge(t, (k - 1) * m + j);
      if (a[i][j - 1] == 'D')
        for (int k = n; k >= i + 1; --k)
          if (a[k][j - 1] != '.') addedge(t, (k - 1) * m + j);
      if (a[i][j - 1] == 'L')
        for (int k = 0; k <= j - 2; ++k)
          if (a[i][k] != '.') addedge(t, (i - 1) * m + k + 1);
      if (a[i][j - 1] == 'R')
        for (int k = m - 1; k >= j; --k)
          if (a[i][k] != '.') addedge(t, (i - 1) * m + k + 1);
    }
  memset(bi, true, sizeof(bi));
  bi[0] = false;
  d[0] = 0;
  dfs(9);
  int ans = 0, ans2 = 0;
  for (int i = 1; i <= n * m; ++i) {
    memset(bi, true, sizeof(bi));
    memset(d, 0, sizeof(d));
    bi[i] = false;
    dfs(i);
    if (d[i] > ans) {
      ans = d[i];
      ans2 = 1;
    } else if (d[i] == ans)
      ans2++;
  }
  printf("%d %d\n", ans + 1, ans2);
  return 0;
}
