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;
int N, M, Tot, Ans, Count;
char Map[5005][5005];
int Mark[5005][5005];
char Arrow[5005];
int LPrev[5005], LNext[5005], RPrev[5005], RNext[5005];
int LPCpy[5005], LNCpy[5005], RPCpy[5005], RNCpy[5005];
inline void Update(int Val) {
  if (Val > Ans) {
    Ans = Val;
    Count = 0;
  }
  if (Val == Ans) ++Count;
}
inline int Goes(int V) {
  memcpy(LPrev, LPCpy, sizeof(LPrev));
  memcpy(LNext, LNCpy, sizeof(LNext));
  memcpy(RPrev, RPCpy, sizeof(RPrev));
  memcpy(RNext, RNCpy, sizeof(RNext));
  int Result = 0;
  for (int W = 0; V != 0; V = W, W = 0, ++Result) {
    if (Arrow[V] == 'L') W = LPrev[V];
    if (Arrow[V] == 'R') W = LNext[V];
    if (Arrow[V] == 'U') W = RPrev[V];
    if (Arrow[V] == 'D') W = RNext[V];
    LPrev[LNext[V]] = LPrev[V];
    LNext[LPrev[V]] = LNext[V];
    RPrev[RNext[V]] = RPrev[V];
    RNext[RPrev[V]] = RNext[V];
  }
  return Result;
}
int main() {
  scanf("%d%d", &N, &M);
  Tot = 0;
  for (int i = 1; i <= N; ++i)
    for (int j = 1; j <= M; ++j) {
      char Ch = getchar();
      while (Ch != '.' && !isupper(Ch)) Ch = getchar();
      Map[i][j] = Ch;
      if (isupper(Ch)) {
        Mark[i][j] = ++Tot;
        Arrow[Tot] = Ch;
      }
    }
  for (int i = 1; i <= N; ++i) {
    int Last = 0;
    for (int j = 1; j <= M; ++j)
      if (isupper(Map[i][j])) {
        LPCpy[Mark[i][j]] = Last;
        LNCpy[Last] = Mark[i][j];
        Last = Mark[i][j];
      }
    LNCpy[Last] = 0;
  }
  for (int j = 1; j <= M; ++j) {
    int Last = 0;
    for (int i = 1; i <= N; ++i)
      if (isupper(Map[i][j])) {
        RPCpy[Mark[i][j]] = Last;
        RNCpy[Last] = Mark[i][j];
        Last = Mark[i][j];
      }
    RNCpy[Last] = 0;
  }
  Ans = 0, Count = 0;
  for (int i = 1; i <= Tot; ++i) Update(Goes(i));
  printf("%d %d\n", Ans, Count);
  return 0;
}
