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;
const int N = 5050;
char s[N];
int l[N], r[N], u[N], d[N], n, m, x[N], y[N];
int ID(int i, int j) { return (i - 1) * m + j; }
void Del(int id) {
  int L = l[id], R = r[id], U = u[id], D = d[id];
  if (L) r[L] = R;
  if (R) l[R] = L;
  if (U) d[U] = D;
  if (D) u[D] = U;
}
void init() {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      int id = ID(i, j);
      if (i > 1) u[id] = ID(i - 1, j);
      if (i < n) d[id] = ID(i + 1, j);
      if (j > 1) l[id] = ID(i, j - 1);
      if (j < m) r[id] = ID(i, j + 1);
    }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      int id = ID(i, j);
      if (s[id] == '.') Del(id);
    }
}
int Calc(int id) {
  if (s[id] == '.') return 0;
  init();
  int ans = 0;
  while (id) {
    Del(id);
    if (s[id] == 'U')
      id = u[id];
    else if (s[id] == 'D')
      id = d[id];
    else if (s[id] == 'L')
      id = l[id];
    else if (s[id] == 'R')
      id = r[id];
    ans++;
  }
  return ans;
}
char Read() {
  char c = getchar();
  while (c != '.' && c != 'U' && c != 'D' && c != 'L' && c != 'R')
    c = getchar();
  return c;
}
int main() {
  scanf("%i %i", &n, &m);
  for (int i = 1; i <= n * m; i++) s[i] = Read();
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) x[ID(i, j)] = i, y[ID(i, j)] = j;
  int sol = 0, cnt = 0;
  for (int i = 1; i <= n * m; i++) {
    int ans = Calc(i);
    if (ans > sol) sol = ans, cnt = 0;
    if (ans == sol) cnt++;
  }
  printf("%i %i\n", sol, cnt);
  return 0;
}
