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 fx[] = {-1, 0, 1, 0}, fy[] = {0, 1, 0, -1};
int n, m, res, cnt;
int ch, col;
int a[300][300], nx[300][300][4], mx[300][300][4], ny[300][300][4],
    my[300][300][4], w[300][300];
void dfs(int x, int y, int dir) {
  cnt++;
  w[x][y] = col;
  int xx, yy;
  while (1) {
    xx = nx[x][y][dir];
    yy = ny[x][y][dir];
    if ((xx < 0 || xx >= n || yy < 0 || yy >= m) ||
        (w[xx][yy] != col && a[xx][yy] >= 0))
      break;
    nx[x][y][dir] = nx[xx][yy][dir];
    ny[x][y][dir] = ny[xx][yy][dir];
  }
  xx = nx[x][y][dir];
  yy = ny[x][y][dir];
  if (xx >= 0 && xx < n && yy >= 0 && yy < m) dfs(xx, yy, a[xx][yy]);
}
int main() {
  scanf("%d %d\n", &n, &m);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      ch = getchar();
      if (ch == 'U') a[i][j] = 0;
      if (ch == 'R') a[i][j] = 1;
      if (ch == 'D') a[i][j] = 2;
      if (ch == 'L') a[i][j] = 3;
      if (ch == '.') a[i][j] = -1;
    }
    scanf("\n");
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      for (int k = 0; k < 4; k++)
        mx[i][j][k] = i + fx[k], my[i][j][k] = j + fy[k];
  int amo = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0, ii, jj, k; j < m; j++) {
      if (a[i][j] < 0) continue;
      for (ii = 0; ii < n; ii++)
        for (jj = 0; jj < m; jj++)
          for (k = 0; k < 4; k++)
            nx[ii][jj][k] = mx[ii][jj][k], ny[ii][jj][k] = my[ii][jj][k];
      cnt = 0;
      col++;
      dfs(i, j, a[i][j]);
      if (res == cnt)
        amo++;
      else if (res < cnt)
        res = cnt, amo = 1;
    }
  printf("%d %d\n", res, amo);
  return 0;
}
