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 main() {
  int n, m;
  cin >> n >> m;
  vector<string> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  int A[n][m][4];
  memset(A, -1, sizeof A);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (v[i][j] != '.') {
        for (int k = i - 1; k >= 0; k--)
          if (v[k][j] != '.') {
            A[i][j][0] = k;
            break;
          }
        for (int k = j + 1; k < m; k++)
          if (v[i][k] != '.') {
            A[i][j][1] = k;
            break;
          }
        for (int k = i + 1; k < n; k++)
          if (v[k][j] != '.') {
            A[i][j][2] = k;
            break;
          }
        for (int k = j - 1; k >= 0; k--)
          if (v[i][k] != '.') {
            A[i][j][3] = k;
            break;
          }
      }
    }
  int Aux[n][m][4];
  int mx = 0;
  int C[5001] = {};
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (v[i][j] != '.') {
        for (int k = 0; k < n; k++)
          for (int l = 0; l < m; l++)
            for (int f = 0; f < 4; f++) Aux[k][l][f] = A[k][l][f];
        int di = i;
        int dj = j;
        int r = 0;
        while (di != -1 && dj != -1) {
          r++;
          if (Aux[di][dj][0] != -1) Aux[A[di][dj][0]][dj][2] = Aux[di][dj][2];
          if (Aux[di][dj][1] != -1) Aux[di][Aux[di][dj][1]][3] = Aux[di][dj][3];
          if (Aux[di][dj][2] != -1) Aux[Aux[di][dj][2]][dj][0] = Aux[di][dj][0];
          if (Aux[di][dj][3] != -1) Aux[di][Aux[di][dj][3]][1] = Aux[di][dj][1];
          if (v[di][dj] == 'R')
            dj = Aux[di][dj][1];
          else if (v[di][dj] == 'L')
            dj = Aux[di][dj][3];
          else if (v[di][dj] == 'D')
            di = Aux[di][dj][2];
          else if (v[di][dj] == 'U')
            di = Aux[di][dj][0];
        }
        mx = max(mx, r);
        C[r]++;
      }
    }
  cout << mx << " " << C[mx];
}
