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 N = 5010;
int n, m;
int pnt[N * 4], last;
char tab[N][N], a[N][N];
int find(int x) {
  if (x != pnt[x]) pnt[x] = find(pnt[x]);
  return pnt[x];
}
int id(int x, int y, int d) { return (x * m + y) * 4 + d; }
void add(int x, int y) {
  pnt[id(x, y, 0)] = x - 1 >= 0 ? id(x - 1, y, 0) : last;
  pnt[id(x, y, 1)] = x + 1 < n ? id(x + 1, y, 1) : last;
  pnt[id(x, y, 2)] = y - 1 >= 0 ? id(x, y - 1, 2) : last;
  pnt[id(x, y, 3)] = y + 1 < m ? id(x, y + 1, 3) : last;
}
void solve() {
  int ans = 0, cnt;
  last = n * m * 4;
  for (int i = 0; i < n; ++i) scanf("%s", tab[i]);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      if (tab[i][j] == '.') continue;
      for (int u = 0; u <= last; ++u) pnt[u] = u;
      for (int u = 0; u < n; ++u)
        for (int v = 0; v < m; ++v) {
          a[u][v] = tab[u][v];
          if (a[u][v] == '.') add(u, v);
        }
      int x = i, y = j, t = 0;
      while (1) {
        t++;
        int dir;
        if (a[x][y] == 'U') dir = 0;
        if (a[x][y] == 'D') dir = 1;
        if (a[x][y] == 'L') dir = 2;
        if (a[x][y] == 'R') dir = 3;
        add(x, y);
        int p = find(id(x, y, dir));
        if (p == last) break;
        x = p / 4 / m;
        y = p / 4 % m;
      }
      if (ans < t)
        ans = t, cnt = 1;
      else if (ans == t)
        cnt++;
    }
  printf("%d %d\n", ans, cnt);
}
int main() {
  while (scanf("%d%d", &n, &m) != EOF) {
    solve();
  }
  return 0;
}
