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>
int a[5005][5005] = {0};
int visited[5005][5005] = {0};
int n, m;
int p = 0;
int dir[5005];
int step = 0;
void dfs(int x, int y) {
  if (x < 1 || x > n || y < 1 || y > m) return;
  p++;
  dir[p] = a[x][y];
  if (visited[x][y] || dir[p] == 0) {
    dir[p] = dir[p - 1];
    switch (dir[p]) {
      case 1: {
        int i, j;
        i = x, j = y;
        while (visited[i][j] == 1 || a[i][j] == 0) {
          i--;
        }
        dfs(i, j);
        break;
      }
      case 2: {
        int i, j;
        i = x, j = y;
        while (visited[i][j] == 1 || a[i][j] == 0) {
          j++;
        }
        dfs(i, j);
        break;
      }
      case 3: {
        int i, j;
        i = x, j = y;
        while (visited[i][j] == 1 || a[i][j] == 0) {
          i++;
        }
        dfs(i, j);
        break;
      }
      case 4: {
        int i, j;
        i = x, j = y;
        while (visited[i][j] == 1 || a[i][j] == 0) {
          j--;
        }
        dfs(i, j);
        break;
      }
    }
  } else {
    step++;
    visited[x][y] = 1;
    switch (dir[p]) {
      case 1:
        dfs(x - 1, y);
        break;
      case 2:
        dfs(x, y + 1);
        break;
      case 3:
        dfs(x + 1, y);
        break;
      case 4:
        dfs(x, y - 1);
        break;
    }
  }
  return;
}
int main() {
  int i, j;
  char ss[10];
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    scanf("%s", ss);
    for (j = 0; j < m; j++) {
      if (ss[j] == '.') a[i][j + 1] = 0;
      if (ss[j] == 'U') a[i][j + 1] = 1;
      if (ss[j] == 'R') a[i][j + 1] = 2;
      if (ss[j] == 'D') a[i][j + 1] = 3;
      if (ss[j] == 'L') a[i][j + 1] = 4;
    }
  }
  int ans = 0, cnt = 0;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= m; j++) {
      if (a[i][j] == 0) continue;
      memset(visited, 0, sizeof(visited));
      memset(a, -1, sizeof(a));
      step = 0;
      dfs(i, j);
      if (step > ans) {
        ans = step;
        cnt = 1;
      } else if (step == ans)
        cnt++;
    }
  printf("%d %d", ans, cnt);
  return 0;
}
