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>
char map[5001][5001];
int judge[5001][5001];
int e[5001][5001] = {0};
int n, m, ans = {0}, sum, max;
void input() {
  int i;
  char c;
  scanf("%d %d", &n, &m);
  scanf("%c", &c);
  ans = 0;
  max = 0;
  for (i = 0; i < n; i++) {
    scanf("%s", map[i]);
  }
}
int main() {
  int i, j, k, x, y, find;
  input();
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++)
      if (e[i][j] == 0) {
        memset(judge, 0, sizeof(judge));
        if (map[i][j] != '.') {
          sum = 1;
          x = i;
          y = j;
          judge[i][j] = 1;
          e[x][y] = 1;
          while (1) {
            find = 0;
            if (map[x][y] == 'U') {
              for (k = x; k >= 0; k--)
                if (map[k][y] != '.' && judge[k][y] == 0) {
                  find = 1;
                  sum++;
                  judge[k][y] = 1;
                  x = k;
                  e[x][y] = 1;
                  break;
                }
            } else if (map[x][y] == 'D') {
              for (k = x; k < n; k++)
                if (map[k][y] != '.' && judge[k][y] == 0) {
                  find = 1;
                  sum++;
                  judge[k][y] = 1;
                  x = k;
                  e[x][y] = 1;
                  break;
                }
            } else if (map[x][y] == 'L') {
              for (k = y; k >= 0; k--)
                if (map[x][k] != '.' && judge[x][k] == 0) {
                  find = 1;
                  sum++;
                  judge[x][k] = 1;
                  y = k;
                  e[x][y] = 1;
                  break;
                }
            } else if (map[x][y] == 'R') {
              for (k = y; k < m; k++)
                if (map[x][k] != '.' && judge[x][k] == 0) {
                  find = 1;
                  sum++;
                  judge[x][k] = 1;
                  y = k;
                  e[x][y] = 1;
                  break;
                }
            }
            if (find == 0) break;
          }
          if (sum == max) ans++;
          if (sum > max) {
            max = sum;
            ans = 1;
          }
        }
      }
  printf("%d %d\n", max, ans);
  return 0;
}
