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;
const int mxn = 5006;
int ans = -1, tot;
int n, m;
class tien {
 public:
  int U, D, L, R;
  inline void ini() { U = D = L = R = 1; }
} * a[mxn];
char *c[mxn];
inline void erase(int x, int y) {
  a[x][y - a[x][y].L].R += a[x][y].R;
  a[x][y + a[x][y].R].L += a[x][y].L;
  a[x - a[x][y].U][y].D += a[x][y].D;
  a[x + a[x][y].D][y].U += a[x][y].U;
}
inline int cal(int x, int y) {
  int re = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) a[i][j].ini();
  char faon;
  while (c[x][y]) {
    erase(x, y);
    if (c[x][y] != '.') {
      faon = c[x][y];
      ++re;
    }
    if (faon == 'U') {
      x -= a[x][y].U;
    } else if (faon == 'D') {
      x += a[x][y].D;
    } else if (faon == 'L') {
      y -= a[x][y].L;
    } else if (faon == 'R') {
      y += a[x][y].R;
    }
  }
  return re;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i <= n + 1; ++i) {
    c[i] = new char[m + 2];
    a[i] = new tien[m + 2];
  }
  for (int i = 0; i <= m + 1; ++i) c[0][i] = c[n + 1][i] = 0;
  for (int i = 1; i <= n; ++i) {
    scanf("%s", c[i] + 1);
    c[i][0] = c[i][m + 1] = 0;
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (c[i][j] != '.') {
        int t = cal(i, j);
        if (t > ans) {
          ans = t;
          tot = 1;
        } else if (t == ans) {
          ++tot;
        }
      }
  printf("%d %d\n", ans, tot);
  return 0;
}
