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;
struct piece {
  int row;
  int col;
  int direction;
  int distanceToNextPiece;
  int onBoard;
} Pieces[5000];
char map[5000][5000];
int pieceNum[5000][5000];
int charToDirection(char c) {
  switch (c) {
    case 'U':
      return 0;
    case 'D':
      return 1;
    case 'L':
      return 2;
    default:
      return 3;
  }
}
int calculatePoints(int initialPiece, int n, int m) {
  int points, row, col, r, c, currentPiece, i, j;
  points = 0;
  currentPiece = initialPiece;
  while (1) {
    row = Pieces[currentPiece].row;
    col = Pieces[currentPiece].col;
    Pieces[currentPiece].onBoard = 0;
    points++;
    i = row;
    j = col;
    switch (Pieces[currentPiece].direction) {
      case 0:
        r = row - 1 - Pieces[currentPiece].distanceToNextPiece;
        c = col;
        if (pieceNum[r][c] != -1 && Pieces[pieceNum[r][c]].onBoard)
          currentPiece = pieceNum[r][c];
        else {
          for (i = r; i >= 0; i--) {
            if (pieceNum[i][c] != -1 && Pieces[pieceNum[i][c]].onBoard) {
              currentPiece = pieceNum[i][c];
              break;
            }
          }
        }
        break;
      case 1:
        r = row + 1 + Pieces[currentPiece].distanceToNextPiece;
        c = col;
        if (pieceNum[r][c] != -1 && Pieces[pieceNum[r][c]].onBoard)
          currentPiece = pieceNum[r][c];
        else {
          for (i = r; i < n; i++) {
            if (pieceNum[i][c] != -1 && Pieces[pieceNum[i][c]].onBoard) {
              currentPiece = pieceNum[i][c];
              break;
            }
          }
        }
        break;
      case 2:
        r = row;
        c = col - 1 - Pieces[currentPiece].distanceToNextPiece;
        if (pieceNum[r][c] != -1 && Pieces[pieceNum[r][c]].onBoard)
          currentPiece = pieceNum[r][c];
        else {
          for (j = c; j >= 0; j--) {
            if (pieceNum[r][j] != -1 && Pieces[pieceNum[r][j]].onBoard) {
              currentPiece = pieceNum[r][j];
              break;
            }
          }
        }
        break;
      case 3:
        r = row;
        c = col + 1 + Pieces[currentPiece].distanceToNextPiece;
        if (pieceNum[r][c] != -1 && Pieces[pieceNum[r][c]].onBoard)
          currentPiece = pieceNum[r][c];
        else {
          for (j = c; j < m; j++) {
            if (pieceNum[r][j] != -1 && Pieces[pieceNum[r][j]].onBoard) {
              currentPiece = pieceNum[r][j];
              break;
            }
          }
        }
        break;
    }
    if (i < 0 || i >= n || j < 0 || j >= m) break;
  }
  return points;
}
int main() {
  int n, m, i, j, pcs, max, pts, cnt;
  char buffer[5000 + 1];
  scanf("%d %d\n", &n, &m);
  pcs = 0;
  for (i = 0; i < n; i++) {
    fgets(buffer, 5000 + 1, stdin);
    for (j = 0; j < m; j++) {
      map[i][j] = buffer[j];
      if (map[i][j] != '.') {
        pieceNum[i][j] = pcs;
        Pieces[pcs].row = i;
        Pieces[pcs].col = j;
        Pieces[pcs].direction = charToDirection(map[i][j]);
        Pieces[pcs].distanceToNextPiece = 0;
        pcs++;
      } else
        pieceNum[i][j] = -1;
    }
  }
  max = 0;
  cnt = 0;
  for (i = 0; i < pcs; i++) {
    pts = 0;
    for (j = 0; j < pcs; j++) Pieces[j].onBoard = 1;
    pts = calculatePoints(i, n, m);
    if (pts > max) {
      max = pts;
      cnt = 1;
    } else if (pts == max)
      cnt++;
  }
  printf("%d %d\n", max, cnt);
  return 0;
}
