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;
inline int get(int i, int j, int m) { return j + i * m; }
int g(char c) {
  if (c == 'U') return 3;
  if (c == 'R') return 0;
  if (c == 'L') return 1;
  if (c == 'D') return 2;
  return 0;
}
int main() {
  int a[6000][4];
  int gg[6000];
  memset(a, -1, sizeof(a));
  string s[5000];
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int nc = get(i, j, m);
      gg[nc] = g(s[i][j]);
    }
  }
  for (int i = 0; i < n; i++) {
    int cur = -1;
    for (int j = 0; j < m; j++) {
      if (s[i][j] != '.') {
        int nc = get(i, j, m);
        if (cur != -1) a[cur][0] = nc;
        cur = nc;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    int cur = -1;
    for (int j = m - 1; j >= 0; j--) {
      if (s[i][j] != '.') {
        int nc = get(i, j, m);
        if (cur != -1) a[cur][1] = nc;
        cur = nc;
      }
    }
  }
  for (int i = 0; i < m; i++) {
    int cur = -1;
    for (int j = 0; j < n; j++) {
      if (s[j][i] != '.') {
        int nc = get(j, i, m);
        if (cur != -1) a[cur][2] = nc;
        cur = nc;
      }
    }
  }
  for (int i = 0; i < m; i++) {
    int cur = -1;
    for (int j = n - 1; j >= 0; j--) {
      if (s[j][i] != '.') {
        int nc = get(j, i, m);
        if (cur != -1) a[cur][3] = nc;
        cur = nc;
      }
    }
  }
  int best = -1;
  int bn = 0;
  int mn = m * n;
  int z[4] = {1, 0, 3, 2};
  for (int i = 0; i < mn; i++) {
    if (s[i / m][i % m] != '.') {
      int c[6000][4];
      memcpy(c, a, sizeof(a));
      int cur = i;
      int cnt = 0;
      while (cur != -1) {
        for (int k = 0; k < 4; k++) {
          int t = c[cur][k];
          if (t != -1) {
            c[t][z[k]] = c[cur][z[k]];
          }
        }
        cnt++;
        cur = c[cur][gg[cur]];
      }
      if (cnt > best) {
        best = cnt;
        bn = 1;
      } else if (cnt == best) {
        bn++;
      }
    }
  }
  cout << best << " " << bn << endl;
  return 0;
}
