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;
inline int refer(int cx, int cy) { return cx * m + cy; }
int main() {
  cin >> n >> m;
  vector<string> pole(n);
  for (int i = 0; i < n; i++) cin >> pole[i];
  int mresw[5001], vis[5001];
  memset(mresw, 0, sizeof(mresw));
  memset(vis, 0, sizeof(vis));
  int mre = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (pole[i][j] != '.') {
        int tre = 1;
        int cx = i;
        int cy = j;
        while (1) {
          vis[refer(cx, cy)] = 1;
          if (pole[cx][cy] == 'U') {
            cx--;
            while (cx >= 0 && (pole[cx][cy] == '.' || vis[refer(cx, cy)] == 1))
              cx--;
            if (cx < 0)
              break;
            else {
              tre++;
              continue;
            }
          }
          if (pole[cx][cy] == 'D') {
            cx++;
            while (cx < n && (pole[cx][cy] == '.' || vis[refer(cx, cy)] == 1))
              cx++;
            if (cx == n)
              break;
            else {
              tre++;
              continue;
            }
          }
          if (pole[cx][cy] == 'L') {
            cy--;
            while (cy >= 0 && (pole[cx][cy] == '.' || vis[refer(cx, cy)] == 1))
              cy--;
            if (cy < 0)
              break;
            else {
              tre++;
              continue;
            }
          }
          if (pole[cx][cy] == 'R') {
            cy++;
            while (cy < m && (pole[cx][cy] == '.' || vis[refer(cx, cy)] == 1))
              cy++;
            if (cy == m)
              break;
            else {
              tre++;
              continue;
            }
          }
        }
        mre = max(mre, tre);
        mresw[refer(i, j)] = tre;
      }
  int tcnt = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      if (mresw[refer(i, j)] == mre) tcnt++;
  cout << mre << " " << tcnt << "\n";
  return 0;
}
