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;
const int maxn = 5010;
int sn, sx[maxn], sy[maxn];
int h, w;
vector<vector<int> > a, b, nextX[4], nextY[4];
vector<vector<char> > s;
int dx[] = {1, 0, -1, 0, 0};
int dy[] = {0, 1, 0, -1, 0};
const char *str = "RDLU.";
int Max, Num;
int main() {
  int F = 0;
  scanf("%d%d", &h, &w);
  if (h <= w) {
    s = vector<vector<char> >(h, vector<char>(w + 1, 0));
    for (int i = 0; i < (int)(h); i++)
      for (int j = 0; j < (int)(w); j++) scanf(" %c", &s[i][j]);
  } else {
    swap(w, h), F = 1;
    s = vector<vector<char> >(h, vector<char>(w + 1, 0));
    for (int i = 0; i < (int)(w); i++)
      for (int j = 0; j < (int)(h); j++) scanf(" %c", &s[j][i]);
  }
  a = vector<vector<int> >(h + 2, vector<int>(w + 2, -1));
  for (int j = 0; j < (int)(4); j++) {
    nextX[j] = vector<vector<int> >(h + 2, vector<int>(w + 2, -1));
    nextY[j] = vector<vector<int> >(h + 2, vector<int>(w + 2, -1));
  }
  for (int i = 0; i < (int)(h); i++)
    for (int j = 0; j < (int)(w); j++) {
      int &x = a[i + 1][j + 1];
      x = strchr(str, s[i][j]) - str;
      if (F && x < 4) x ^= 1;
    }
  for (int i = (int)(1); i <= (int)(h); i++)
    for (int j = (int)(1); j <= (int)(w); j++)
      if (a[i][j] != 4) {
        b = a;
        for (int k = 0; k < (int)(4); k++)
          for (int i = (int)(1); i <= (int)(h); i++)
            for (int j = (int)(1); j <= (int)(w); j++)
              nextX[k][i][j] = -1, nextY[k][i][j] = -1;
        int dir = -1, x = j, y = i, score = 0;
        while (b[y][x] != -1) {
          score++, dir = b[y][x], b[y][x] = 4;
          sn = 0;
          while (b[y][x] == 4) {
            sx[sn] = x, sy[sn++] = y;
            if (nextX[dir][y][x] != -1) {
              int x1 = nextX[dir][y][x];
              int y1 = nextY[dir][y][x];
              x = x1, y = y1;
            } else
              x += dx[dir], y += dy[dir];
          }
          for (int i = 0; i < (int)(sn); i++) {
            nextX[dir][sy[i]][sx[i]] = x;
            nextY[dir][sy[i]][sx[i]] = y;
          }
        }
        if (score > Max)
          Max = score, Num = 1;
        else if (score == Max)
          Num++;
      }
  printf("%d %d\n", Max, Num);
  return 0;
}
