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 n, m, it = 0, posx[5010], posy[5010];
char board[5010][5010], dir[5010];
int operation(int x, int y) {
  int ans = 0;
  while (board[x][y] != '.') {
    posx[it] = x;
    posy[it] = y;
    dir[it] = board[x][y];
    it++;
    switch (board[x][y]) {
      case 'L': {
        board[x][y] = '.';
        for (int i = y - 1; i >= 0; i--)
          if (board[x][i] != '.') {
            y = i;
            break;
          }
        ans++;
        break;
      }
      case 'R': {
        board[x][y] = '.';
        for (int i = y + 1; i < m; i++)
          if (board[x][i] != '.') {
            y = i;
            break;
          }
        ans++;
        break;
      }
      case 'U': {
        board[x][y] = '.';
        for (int i = x - 1; i >= 0; i--)
          if (board[i][y] != '.') {
            x = i;
            break;
          }
        ans++;
        break;
      }
      case 'D': {
        board[x][y] = '.';
        for (int i = x + 1; i < n; i++)
          if (board[i][y] != '.') {
            x = i;
            break;
          }
        ans++;
        break;
      }
    }
  }
  return ans;
}
int main() {
  int max = 0, num = 0;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%s", board[i]);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (board[i][j] != '.') {
        for (int iii = 0; iii < it; iii++)
          board[posx[iii]][posy[iii]] = dir[iii];
        it = 0;
        int opt = operation(i, j);
        if (opt > max) {
          max = opt;
          num = 1;
        } else if (opt == max) {
          num++;
        }
      }
  printf("%d %d\n", max, num);
  return 0;
}
