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 INF = 2147483647;
const double PI = 3.141592653589793;
int licz, maxx, i, j, akt, n, m, L[5005], R[5005], U[5005], D[5005], sum, w;
char dir[5005];
char t[5005];
vector<int> wek;
void hide(int a) {
  L[R[a]] = L[a];
  R[L[a]] = R[a];
  U[D[a]] = U[a];
  D[U[a]] = D[a];
}
void show(int a) {
  L[R[a]] = a;
  R[L[a]] = a;
  U[D[a]] = a;
  D[U[a]] = a;
}
void wypisz() {
  for (int i = 1; i <= n * m; i++)
    printf("%d  %d %d %d %d\n", i, L[i], U[i], R[i], D[i]);
}
int main() {
  scanf("%d %d", &n, &m);
  for (i = 0; i < n; i++) {
    scanf("%s", &t);
    for (j = 0; j < m; j++) {
      w = i * m + j + 1;
      dir[w] = t[j];
      if (j == 0)
        L[w] = 0;
      else
        L[w] = w - 1;
      if (j == m - 1)
        R[w] = 0;
      else
        R[w] = w + 1;
      if (i == 0)
        U[w] = 0;
      else
        U[w] = w - m;
      if (i == n - 1)
        D[w] = 0;
      else
        D[w] = w + m;
    }
  }
  for (i = 1; i <= m * n; i++)
    if (dir[i] == '.') hide(i);
  for (i = 1; i <= m * n; i++)
    if (dir[i] != '.') {
      akt = i;
      licz = 0;
      while (akt != 0) {
        licz++;
        wek.push_back(akt);
        hide(akt);
        if (dir[akt] == 'L')
          akt = L[akt];
        else if (dir[akt] == 'R')
          akt = R[akt];
        else if (dir[akt] == 'U')
          akt = U[akt];
        else if (dir[akt] == 'D')
          akt = D[akt];
      }
      while (wek.size() > 0) {
        show(wek.back());
        wek.pop_back();
      }
      if (licz == maxx)
        sum++;
      else if (licz > maxx) {
        sum = 1;
        maxx = licz;
      }
    }
  printf("%d %d\n", maxx, sum);
  return 0;
}
