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;
int n, m, ans, cnt;
char pole[(int)5e3][(int)5e3];
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> pole[i][j];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      int points = 0;
      int x = i, y = j;
      bool was[n][m];
      memset(was, 0, sizeof(was));
      while (pole[x][y] != '.' && x >= 0 && x < n && y >= 0 && y < m) {
        was[x][y] = true;
        switch (pole[x][y]) {
          case 'L': {
            int k;
            for (k = y; k >= 0; k--)
              if (pole[x][k] != '.' && !was[x][k]) break;
            y = k;
            break;
          }
          case 'R': {
            int k;
            for (k = j; k < m; k++)
              if (pole[x][k] != '.' && !was[x][k]) break;
            y = k;
            break;
          }
          case 'U': {
            int k;
            for (k = i; k >= 0; k--)
              if (pole[k][y] != '.' && !was[k][y]) break;
            x = k;
            break;
          }
          case 'D': {
            int k;
            for (k = i; k < n; k++)
              if (pole[k][y] != '.' && !was[k][y]) break;
            x = k;
            break;
          }
        }
        points++;
      }
      if (points > ans) {
        ans = points;
        cnt = 1;
      } else if (points == ans)
        cnt++;
    }
  cout << ans << ' ' << cnt;
  return 0;
}
