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>
#pragma comment(linker, "/STACK:65777216")
using namespace std;
char D[5001][5001] = {0};
bool used[5001][5001] = {0};
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int move(int x, int y) {
  if (D[x][y] == 'U') return 0;
  if (D[x][y] == 'R') return 1;
  if (D[x][y] == 'D') return 2;
  if (D[x][y] == 'L') return 3;
  return -1;
}
int n, m;
int calc(int x, int y) {
  used[x][y] = true;
  int t = move(x, y);
  while (x + dx[t] >= 0 && x + dx[t] < n && y + dy[t] >= 0 && y + dy[t] < m) {
    if (D[x + dx[t]][y + dy[t]] != '.' && !used[x + dx[t]][y + dy[t]]) {
      return 1 + calc(x + dx[t], y + dy[t]);
    }
    x += dx[t];
    y += dy[t];
  }
  return 1;
}
bool op(char a, char b) {
  if (a == 'L' && b == 'R') return true;
  if (a == 'R' && b == 'L') return true;
  if (a == 'U' && b == 'D') return true;
  if (a == 'D' && b == 'U') return true;
  return false;
}
int calc1(int x, int y) {
  int ret = 1;
  int lx = x, ly = y;
  bool need = false;
  while (true) {
    used[x][y] = true;
    int t = move(x, y);
    bool finded = false;
    int px = x, py = y;
    if (need) x = lx, y = ly;
    lx = px;
    ly = py;
    need = false;
    while (x + dx[t] >= 0 && x + dx[t] < n && y + dy[t] >= 0 && y + dy[t] < m) {
      if (D[x + dx[t]][y + dy[t]] != '.' && !used[x + dx[t]][y + dy[t]]) {
        ret++;
        finded = true;
        if (op(D[lx][ly], D[x + dx[t]][y + dy[t]])) need = true;
        x += dx[t];
        y += dy[t];
        break;
      }
      x += dx[t];
      y += dy[t];
    }
    if (!finded) break;
  }
  return ret;
}
int main() {
  scanf("%d%d\n", &n, &m);
  for (int i = 0; i < n; i++) gets(D[i]);
  int mx = 0, cnt = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      for (int ii = 0; ii < n; ii++)
        for (int jj = 0; jj < m; jj++) used[ii][jj] = 0;
      int val = calc1(i, j);
      if (val == mx) cnt++;
      if (val > mx) mx = val, cnt = 1;
    }
  cout << mx << " " << cnt << endl;
  return 0;
}
